Trees in greedy colorings of hypergraphs

DOI10.1016/j.disc.2010.10.017zbMath1225.05097OpenAlexW2010491244MaRDI QIDQ616002

András Gyárfás, Jenő Lehel

Publication date: 7 January 2011

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

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

zbMATH Keywords

chromatic numbergreedy coloringsubtrees in graphs

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Erdős-Hajnal problem for \(H\)-free hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Chromatic Ramsey number of acyclic hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on embedding hypertrees
• Induced subtrees in graphs of large chromatic number
• Greedy colorings of uniform hypergraphs
• Coloring H-free hypergraphs

This page was built for publication: Trees in greedy colorings of hypergraphs