proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.
On a Theorem of Plünnecke Concerning the Sum of A Basis and A Set of Positive Density
✍ Scribed by J.L. Malouf
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 342 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A conjecture concerning the Crame r Wold device is answered in the negative by giving a Fourier-free, probabilistic proof using only elementary techniques. It is also shown how a geometric idea allows one to interpret the Crame r Wold device as a special case of a more general concept.
Let a 1 , . . . , a n be n real numbers with non-negative sum. We show that if n ≥ 12 there exist at least n-1 2 subsets of {a 1 , . . . , a n } with three elements which have non-negative sum.
We define a group theoretical invariant, denoted by s G , as a solution of a certain set covering problem and show that it is closely related to chl(G), the cohomology length of a p-group G. By studying s G we improve the known upper bounds for the cohomology length of a p-group and determine chl(G)