Topological combinatorics -- the Kneser conjecture

MaRDI QIDQ6495418zbMATH OpenFDO

Authors Satya Deo

Publication date 30 April 2024

Published in The Mathematics Student (Search for Journal in Brave)

zbMATH Keywords

Borsuk-Ulam theoremchromatic number of a graphKneser conjecture\(n\)-connectedness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45) Fixed points and coincidences in algebraic topology (55M20)

Recommendations

• Generalized Kneser coloring theorems with combinatorial proofs
• A combinatorical proof of Kneser's conjecture
• 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
• A course in topological combinatorics
• Topological methods in combinatorial problems

This page was built for publication: Topological combinatorics -- the Kneser conjecture

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