Paul Seymour conjectured that any graph G of order n and minimum degree at least k k+1 n contains the k th power of a Hamilton cycle. We prove the following approximate version. For any > 0 and positive integer k, there is an n 0 such that, if G has order n ≥ n 0 and minimum degree at least ( k k+1
On P. McMullen's Conjecture on Translation Invariant Valuations
✍ Scribed by S Alesker
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 199 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
✦ Synopsis
dedicated to professor vitali d. milman on the occasion of his 60th birthday
1. Introduction
Let R n be the n-dimensional linear space. Let K n denote the family of all convex compact subsets of R n .
Definition 1.1. A scalar valued function
is called a valuation if for every two convex compact sets K 1 , K 2 such that their union is also convex one has
The K n is equipped naturally with the Hausdorff metric and it becomes a locally compact space. In this work we will study only translationinvariant valuations continuous with respect to the Hausdorff metric. Let us recall that the valuation , is called translation invariant if ,(K+x)=,(K) for every convex compact set K # K n and for every vector x # R n . Clearly the space of all such valuations is a linear space.
The basic example of valuations of this type is the mixed volume of K taken j times with some fixed convex compact sets A 1 , ..., A n& j , i.e., ,(K)=V(K[ j], A 1 , ..., A n& j ) (see [Sch1] for definitions and further details).
The classical result in the valuation theory is the Hadwiger characterization of isometry-invariant continuous valuations [H] (see also [K] for a simpler proof
📜 SIMILAR VOLUMES
We prove that if \(\lambda\) is an infinite cardinal number and \(G\) is any graph of cardinality \(\kappa=\lambda^{+}\)which is a union of a finite number of forests, then there is a graph \(H_{k}\) of size \(\kappa\) (which does not depend upon \(G\) ) so that \(H_{k} \rightarrow(G)_{k}^{1}\). Röd
## Abstract The following conjecture of Brualdi and Shen is proven in this paper: let __n__ be partitioned into natural numbers no one of which is greater than (__n__ + 1) / 2. Then, given any sequence of wins for the players of some tournament among n players, there is a partition of the players i