Color the cycles

DOI10.1016/j.disc.2013.04.034zbMath1277.05063OpenAlexW2084316356MaRDI QIDQ383778

Zsolt Tuza, Gyula O. H. Katona

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.034

zbMATH Keywords

cyclecoloringTurán-type problem

Mathematics Subject Classification ID

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

Related Items

Chromatic number via Turán number

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Critical hypergraphs and interesting set-pair systems
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Minimum number of elements of representing a set system of given rank
• Graphs without quadrilaterals
• Cycles of even length in graphs
• Counting substructures. I: Color critical graphs
• A correlation inequality for bipartite graphs
• Triangles in an Ordinary Graph
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item