Generalised Mycielski graphs and the Borsuk-Ulam theorem

zbMath1422.05044arXiv1710.01072MaRDI QIDQ2327221

Tobias Müller, Matěj Stehlík

Publication date: 14 October 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Simplicial sets and complexes in algebraic topology (55U10)

Related Items (2)

Questions on color-critical subgraphs ⋮ Edge-critical subgraphs of Schrijver graphs. II: The general case

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
• On constructive methods in the theory of colour-critical graphs
• 4-chromatic graphs with large odd girth
• A combinatorical proof of Kneser's conjecture
• Colouring quadrangulations of projective spaces
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• A generalization of Tucker's combinatorial lemma with topological applications
• On graphs with strongly independent color-classes
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Sur le coloriage des graphs
• 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

This page was built for publication: Generalised Mycielski graphs and the Borsuk-Ulam theorem