Colorings of the \(d\)-regular infinite tree

DOI10.1016/j.jctb.2003.11.004zbMath1048.05035OpenAlexW1991381366MaRDI QIDQ598463

Shlomo Hoory, Nathan Linial

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.11.004

Mathematics Subject Classification ID

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

Related Items (1)

A topological lower bound for the chromatic number of a special family of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Ramanujan graphs
• Constructions for cubic graphs with large girth
• The Moore bound for irregular graphs

This page was built for publication: Colorings of the \(d\)-regular infinite tree