Generalized Borsuk graphs
From MaRDI portal
Recommendations
Cites work
- A short proof of Kneser's conjecture
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Kneser's conjecture, chromatic number, and homotopy
- New construction of graphs with high chromatic number and small clique number
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Random Geometric Graphs
- The chromatic number of random Borsuk graphs
- The neighborhood complex of a random graph
- Topological obstructions to graph colorings
- 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: Generalized Borsuk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642292)