On a conjecture of Rödl and Voigt

DOI10.1006/JCTB.1994.1044zbMath0802.05076OpenAlexW2309422568MaRDI QIDQ1333339

Péter Komjáth, Eric C. Milner

Publication date: 28 November 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1044

zbMATH Keywords

regular treeforestscolouring numberconjecture of Rödl and Voigt

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (2)

The use of elementary substructures in combinatorics ⋮ Two remarks on the coloring number

This page was built for publication: On a conjecture of Rödl and Voigt