combinatorics / Graph theory
Gao, Huo and Ma asked whether for every fixed $k \ge 3$ there is a function $f_k(n) \to \infty$ such that every $n$-vertex $(k+1)$-critical graph contains $f_k(n)$ consecutive cycle lengths. The paper settles this and two related problems on cycle lengths and cycles with chords under chromatic and degree constraints.
Temporal state
No reconciled state yet.
Append-only history
Gao, Huo and Ma asked whether for every fixed $k \ge 3$ there is a function $f_k(n) \to \infty$ such that every $n$-vertex $(k+1)$-critical graph contains $f_k(n)$ consecutive cycle lengths. The paper settles this and two related problems on cycle lengths and cycles with chords under chromatic and degree constraints.
Research memory
Gao, Huo and Ma asked whether for every fixed $k \ge 3$ there is a function $f_k(n) \to \infty$ such that every $n$-vertex $(k+1)$-critical graph contains $f_k(n)$ consecutive cycle lengths. The paper settles this and two related problems on cycle lengths and cycles with chords under chromatic and degree constraints.
Evidence graph
No public relationships recorded yet.