Trees in greedy colorings of hypergraphs

DOI10.1016/J.DISC.2010.10.017zbMATH Open1225.05097OpenAlexW2010491244MaRDI QIDQ616002FDOQ616002

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

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

zbMATH Keywords

chromatic numbergreedy coloringsubtrees in graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Coloring \(H\)-free hypergraphs
• Induced subtrees in graphs of large chromatic number
• A note on embedding hypertrees
• Greedy colorings of uniform hypergraphs

Cited In (6)

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