Kneser's conjecture, chromatic number, and homotopy

1978/11/01 by László Lovász, L Lovász · 5 citations
Computer Science · Mathematics · #Advanced Topology and Set Theory #Chromatic scale #Combinatorics #Conjecture #Corollary #Discrete mathematics #Disjoint sets #Graph #Homotopy #Limits and Structures in Graph Theory #Mathematics #Pure mathematics #Simplicial complex #Topological and Geometric Data Analysis

paper · pdf · doi:10.1016/0097-3165(78)90022-5

crossref issued 1978/11/01 · crossref published 1978/11/01 · crossref published-print 1978/11/01 · openalex publication_date 1978/11/01 · crossref created 2004/09/08 · crossref deposited 2019/02/03 · openalex created_date 2025/10/10 · crossref indexed 2026/07/25 · openalex updated_date 2026/08/02

Citations

• Drei Sätze über die n-dimensionale euklidische Sphäre
• On chromatic number of graphs and set-systems

Cited by

• Extreme amenability of abelian L₀ groups
• Twins in graphs
• Fractional chromatic numbers of cones over graphs
• Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes
• Kneser graph [wikipedia]