Trees in greedy colorings of hypergraphs

DOI10.1016/J.DISC.2010.10.017MaRDI QIDQ616002zbMATH OpenOpenAlexFDO

Authors András Gyárfás, Jeno 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) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• A note on embedding hypertrees
• Greedy colorings of uniform hypergraphs
• A note on random greedy coloring of uniform hypergraphs
• Chromatic Ramsey number of acyclic hypergraphs
• Coloring \(H\)-free hypergraphs

Cites work

• scientific article; zbMATH DE number 3747156 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• A note on embedding hypertrees
• Coloring \(H\)-free hypergraphs
• Greedy colorings of uniform hypergraphs
• Induced subtrees in graphs of large chromatic number

Cited in

(6)

• Coloring mixed hypertrees
• Extremal problems in hypergraph colourings
• Erdős-Hajnal problem for \(H\)-free hypergraphs
• Chromatic Ramsey number of acyclic hypergraphs
• On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
• A note on embedding hypertrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616002)