A Unified Proof of Conjectures on Cycle Lengths in Graphs

@article{Gao2019AUP,
  title={A Unified Proof of Conjectures on Cycle Lengths in Graphs},
  author={Jun-ming Gao and Qingyi Huo and Chun-Hung Liu and Jie Ma},
  journal={arXiv: Combinatorics},
  year={2019}
}
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain a number of exact and optimal results on cycle lengths in graphs of given minimum degree, connectivity or chromatic number. More precisely, we prove the following statements by a unified approach. (1) Every graph $G$ with minimum degree at least $k+1… 

Cycles of many lengths in Hamiltonian graphs

Abstract In 1999, Jacobson and Lehel conjectured that, for $k \geq 3$ , every k-regular Hamiltonian graph has cycles of $\Theta (n)$ many different lengths. This was further strengthened by

Cycle lengths modulo $k$ in expanders

. Given a constant α > 0, an n -vertex graph is called an α -expander if every set X of at most n/ 2 vertices in G has an external neighborhood of size at least α | X | . Addressing a question posed

Cycle Lengths in Expanding Graphs

TLDR
It is proved that for every 0 < α ≤ 1 there exist positive constants n 0, C and A = O (1 / α) such that forevery α-expander G on n ≥ n 0 vertices and every integer G contains a cycle whose length is between $$ell$$ and + A ; the order of dependence of the additive error term A on α is optimal.

Cycles in Color-Critical Graphs

Tuza [1992] proved that a graph with no cycles of length congruent to $1$ modulo $k$ is $k$-colorable.  We prove that if a graph $G$ has an edge $e$ such that $G-e$ is $k$-colorable and $G$ is not,

A note on cycle lengths in graphs of chromatic number five and six

In this note, we prove that every non-complete (k+1)-critical graph contains cycles of all lengths modulo k, where k = 4, 5. Together with a result in [7], this completely gives an affirmative answer

Divisible subdivisions

TLDR
It is proved that for every graph H there is a finite f=f(H,q) such that every edge of H contains a subdivision of H in which every edge is replaced by a path whose length is divisible by q.

On a conjecture of Bondy and Vince

Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two.

Gao, Huo, Liu and Ma (2019) proved a result on the existence of paths connecting specified two vertices whose lengths differ by one or two. By using this result, they settled two famous conjectures

Phase Transition of Degeneracy in Minor-Closed Families

Given an infinite family ${\mathcal G}$ of graphs and a monotone property ${\mathcal P}$, an (upper) threshold for ${\mathcal G}$ and ${\mathcal P}$ is a "fastest growing" function $p: \mathbb{N} \to

References

SHOWING 1-10 OF 37 REFERENCES

Cycle lengths and minimum degree of graphs

Non-separating induced cycles in graphs

Cycles in triangle-free graphs of large chromatic number

TLDR
This paper proves the stronger fact that every triangle-free graph G of chromatic number k≥k0(ε) contains cycles of 1/64(1 − ε)k2 logk/4 consecutive lengths, and a cycle of length at least 1/4(1- ε), and gives new lower bounds on the circumference and the number of different cycle lengths for k-chromatic graphs in other monotone classes.

On Arithmetic Progressions of Cycle Lengths in Graphs

TLDR
This paper proves that, for k > 2, a bipartite graph of average degree at least 4k and girth g contains cycles of (g/2 − 1)k consecutive even lengths.

Cycle lengths in sparse graphs

TLDR
The result improves all previously known lower bounds on the length of the longest cycle and shows that Ω ` d (g−1)/2 is a lower bound for the number of odd cycle lengths in a graph of chromatic number d and girth g.

Extremal problems for cycles in graphs

In this survey we consider extremal problems for cycles of prescribed lengths in graphs. The general extremal problem is cast as follows: if \(\mathcal{C}\) is a set of cycles, determine the largest

Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs

Thomassen, in 1983, conjectured that for a positive integer $k$, every $2$-connected non-bipartite graph of minimum degree at least $k + 1$ contains cycles of all lengths modulo $k$. In this paper,

Cycles of even lengths modulo k

  • A. Diwan
  • Mathematics, Computer Science
    J. Graph Theory
  • 2010
TLDR
It is proved that for all positive integers k and m, every graph of minimum degree at least k+1 contains a cycle of length congruent to 2m modulo k if the minimum degree is at least 2k−1, which improves the previously known bound of 3k−2.

The Extremal Function for Cycles of Length l mod k

TLDR
It is shown that c_k(\ell) is proportional to the largest average degree of a $C_{\ell}$-free graph on $k$ vertices, which determines $c_k(ell)$ up to an absolute constant.