Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by Erdo Λs. By a different approach, we show in this paper that if G is a graph with minimum degree d(G) \ 3k for any positive integer k,
Distribution of cycle lengths of infinite permutations
β Scribed by N. V. Tsilevich
- Publisher
- Springer US
- Year
- 1997
- Tongue
- English
- Weight
- 570 KB
- Volume
- 87
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdos and Hajnal stating that for suit
We consider permutations of a multiset which do not contain certain ordered patterns of length 3. For each possible set of patterns we provide a structural description of the permutations avoiding those patterns, and in many cases a complete enumeration of such permutations according to the underlyi