Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers

DOI10.1016/j.jctb.2016.09.007zbMath1350.05041arXiv1601.04642OpenAlexW2526183036MaRDI QIDQ345126

Claude Tardif, Gord Simons, David L. Wehlau

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/1601.04642

zbMATH Keywords

homomorphismsbox complexesgeneralised Mycielski graphsgraph colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Graph classes generated by Mycielskians

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• The chromatic number of the product of two 4-chromatic graphs is 4
• The Magma algebra system. I: The user language
• Topology of Hom complexes and test graphs for bounding chromatic number
• Topological lower bounds for the chromatic number: a hierarchy
• Fractional chromatic numbers of cones over graphs
• Local chromatic number and distinguishing the strength of topological obstructions
• On the Simple ℤ₂-homotopy Types of Graph Complexes and Their Simple ℤ₂-universality
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler