A Strengthening on Odd Cycles in Graphs of Given Chromatic Number

DOI10.1137/20M1387882zbMath1475.05067arXiv2012.10624WikidataQ114074116 ScholiaQ114074116MaRDI QIDQ5157394

Jie Ma, Jun Gao, Qingyi Huo

Publication date: 18 October 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.10624

zbMATH Keywords

chromatic numberodd cyclesconsecutive cyclesGyárfás' theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Cycles in color-critical graphs ⋮ Congruence of cycle lengths and chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring digraphs with forbidden cycles
• The extremal function for cycles of length \(\ell\) mod \(k\)
• Cycles with consecutive odd lengths
• Graph coloring in linear time
• Cycle lengths in sparse graphs
• Graphs with \(k\) odd cycle lengths
• Cycles of length 2 modulo 3 in graphs
• Graphs with a cycle of length divisible by three
• Cycle lengths and minimum degree of graphs
• Cycles in triangle-free graphs of large chromatic number
• Cycles of even length in graphs
• Distribution of cycle lengths in graphs
• Cycle lengths and chromatic number of graphs
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Extremal problems for cycles in graphs
• A Unified Proof of Conjectures on Cycle Lengths in Graphs
• On chromatic number of graphs and set-systems
• Cycles of length 1 modulo 3 in graph

This page was built for publication: A Strengthening on Odd Cycles in Graphs of Given Chromatic Number