Kneser's conjecture, chromatic number, and homotopy

Recommendations

Chromatic homology, Khovanov homology, and torsion
Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
Chromatic numbers and Bohr topologies
Chromatic numbers of simplicial manifolds
Topology of Hom complexes and test graphs for bounding chromatic number
Some Conjectures and Questions in Chromatic Topological Graph Theory
The Chromatic Number of Kneser Hypergraphs
Chromatic numbers of stable Kneser hypergraphs via topological Tverberg-type theorems
On the chromatic number of Kneser hypergraphs
Equivariant Cohomology and Lower Bounds for Chromatic Numbers

Cites work

scientific article; zbMATH DE number 3245178 (Why is no real title available?)
On chromatic number of graphs and set-systems
The Complexity of Near-Optimal Graph Coloring
n-tuple colorings and associated graphs

Cited in

(only showing first 100 items - show all)

On the connectivity of the disjointness graph of segments of point sets in general position in the plane
Colinear Coloring on Graphs
Coloring graph products---a survey
Groups synchronizing a transformation of non-uniform kernel
Stiefel manifolds and coloring the pentagon
Improved bounds on the chromatic numbers of the square of Kneser graphs
A new coloring theorem of Kneser graphs
Extremal problems related to Betti numbers of flag complexes
Hypergraph coloring complexes
Orthogonal partitions and covering of graphs
Reconfiguring graph homomorphisms on the sphere
On the chromatic number of generalized Kneser hypergraphs
On finite simple groups and Kneser graphs.
Total dominator chromatic number of Kneser graphs
On the diameter of Schrijver graphs
On finding constrained independent sets in cycles
Borsuk's theorem through complementary pivoting
Extremal problems concerning Kneser-graphs
Topology of cut complexes of graphs
An antipodal theorem for parametric optimization problems
Deformation retracts of neighborhood complexes of stable Kneser graphs
Box complexes, neighborhood complexes, and the chromatic number
On q-analogues and stability theorems
Hedetniemi's conjecture and adjoint functors in thin categories
Approximating the orthogonality dimension of graphs and hypergraphs
Colouring quadrangulations of projective spaces
On endo-homology of complexes of graphs
Independence numbers and chromatic numbers of some distance graphs
Hedetniemi's conjecture for Kneser hypergraphs
On the multichromatic number of \(s\)-stable Kneser graphs
Topological graph persistence
The neighborhood polynomial of chordal graphs
Large disjoint subgraphs with the same order and size
Tight lower bounds for the complexity of multicoloring
Coloring properties of categorical product of general Kneser hypergraphs
\(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture
Long induced paths and cycles in Kneser graphs
Bipartite Kneser graphs are Hamiltonian
Grundy domination and zero forcing in Kneser graphs
Hajós-type constructions and neighborhood complexes
scientific article; zbMATH DE number 7561683 (Why is no real title available?)
A short proof of \(w_{1}^n (\text{Hom}(C_{2r+1}, K_{n+2})) = 0\) for all \(n\) and a graph colouring theorem by Babson and Kozlov
Colorful subhypergraphs in Kneser hypergraphs
Chromatic number is not tournament-local
The chromatic number of the q-Kneser graph for large q
Hypergraphs with many Kneser colorings
Hamiltonian uniform subset graphs
Homotopy types of box complexes of chordal graphs
Neighborhood hypergraph model for topological data analysis
On graphs with strongly independent color-classes
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
On the chromatic number of general Kneser hypergraphs
Edge-critical subgraphs of Schrijver graphs. II: The general case
On random subgraphs of Kneser and Schrijver graphs
The Neighborhood Polynomial of Chordal Graphs
Intersection patterns of finite sets and of convex sets
Chromatic number of random Kneser hypergraphs
On the number of star‐shaped classes in optimal colorings of Kneser graphs
The chromatic number of almost stable Kneser hypergraphs
Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
Graph colorings, spaces of edges and spaces of circuits
On the circular chromatic number of graph powers
On \(b\)-coloring of the Kneser graphs
Non-projectability of polytope skeleta
Short proofs of the Kneser-Lovász coloring principle
Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
Homotopy type of the neighborhood complexes of graphs of maximal degree at most 3 and 4-regular circulant graphs
Chromatic numbers of Kneser-type graphs
Short proofs of the Kneser-Lovász coloring principle
On the topological lower bound for the multichromatic number
Fractional cocoloring of graphs
Distributed algorithms for fractional coloring
CORES OF SYMMETRIC GRAPHS
On the chromatic number of random subgraphs of a certain distance graph
1-subdivisions, the fractional chromatic number and the Hall ratio
Neighborhood complexes and Kronecker double coverings
Vanishing of all equivariant obstructions and the mapping degree
On chromatic number and minimum cut
On \(r\)-dynamic coloring of graphs
A note on homomorphisms of Kneser hypergraphs
Neighborhood complexes of some exponential graphs
Colouring lines in projective space
Homotopy types of the Hom complexes of 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
Large cycles in generalized Johnson graphs
Extreme amenability of abelian L₀ groups
On the dynamic coloring of graphs
Fractional chromatic numbers of cones over graphs
The complexity of multicolouring
On total and edge coloring some Kneser graphs
Tiling Hamming space with few spheres
Neighborhood complexes of Cayley graphs with generating set of size two
Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes
Spectral gap bounds for the simplicial Laplacian and an application to random complexes
Connectedness of certain graph coloring complexes
Foldings in graphs and relations with simplicial complexes and posets
Conflict-free coloring: graphs of bounded clique-width and intersection graphs
NP-completeness of a family of graph-colouring problems
On the locating chromatic number of Kneser graphs
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems

This page was built for publication: Kneser's conjecture, chromatic number, and homotopy

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