The chromatic number of finite type-graphs

DOI10.1016/j.jctb.2016.10.004zbMath1350.05028arXiv1603.05134OpenAlexW3099835900MaRDI QIDQ345136

Vojtěch Rödl, Christian Avart, Bill Kay, Christian Reiher

Publication date: 25 November 2016

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

Full work available at URL: https://arxiv.org/abs/1603.05134

zbMATH Keywords

chromatic numberorder types of pairsshift graphstype graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Independent sets in subgraphs of a shift graph ⋮ Hedetniemi's conjecture and adjoint functors in thin categories

Cites Work

• Unnamed Item
• Teilmengen von Mengen mit Relationen
• Ordered Ramsey theory and track representations of graphs
• Note on decomposition of spheres in Hilbert spaces
• The Ramsey property for graphs with forbidden complete subgraphs
• Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• Finite subgraphs of uncountably chromatic graphs
• On generalized shift graphs

This page was built for publication: The chromatic number of finite type-graphs