Colorings of the d-regular infinite tree

DOI10.1016/J.JCTB.2003.11.004MaRDI QIDQ598463zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4130438
• On the chromatic number of random \(d\)-regular graphs
• On the regularity of perfect 2-colorings of the Johnson graph
• Colouring Random Regular Graphs
• Publication:4892794

Cites work

• Constructions for cubic graphs with large girth
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• Ramanujan graphs
• The Moore bound for irregular graphs

Cited in

(4)

• Uniqueness of uniform random colorings of regular trees
• A topological lower bound for the chromatic number of a special family of graphs
• Colorings of trees with linear, intermediate and exponential subball complexity
• A unified framework for light spanners

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

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