Colorings of the d-regular infinite tree

DOI10.1016/J.JCTB.2003.11.004zbMATH Open1048.05035OpenAlexW1991381366MaRDI QIDQ598463FDOQ598463

Authors: Shlomo Hoory, Nathan Linial Error creating thumbnail:

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

Recommendations

• Publication:3032308
• 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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Ramanujan graphs
• Title not available (Why is that?)
• The Moore bound for irregular graphs
• Constructions for cubic graphs with large girth

Cited In (3)

• Uniqueness of uniform random colorings of regular trees
• A unified framework for light spanners
• A topological lower bound for the chromatic number of a special family of graphs

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)