Kneser's conjecture, chromatic number, and homotopy

László Lovász

Type: Article

Publication Date: 1978-11-01

Citations: 860

DOI: https://doi.org/10.1016/0097-3165(78)90022-5

Similar Works

Action	Title	Year	Authors
+	Chromatic Numbers and the Kneser Conjecture	2007
+	The chromatic number of Kneser graphs	2009	Martin Aigner Günter M. Ziegler
+	A Glimpse into the Future: Chromatic Number of the Plane, Theorems, and Conjectures	2024	Alexander Soifer
+	A Glimpse into the Future: Chromatic Number of the Plane, Theorems and Conjectures	2008	Alexander Soifer
+	A combinatorial proof for the circular chromatic number of Kneser graphs	2015	Daphne Der‐Fen Liu Xuding Zhu
+	Chromatic Numbers of Kneser-Related Graphs.	2008	Hsun-Wen Chang Meng-Chu Kuo
+	Kneser's Conjecture and its Generalizations	2009	Meysam Alishahi Hossein Hajiabolhassan Ali Taherkhani
+	Chromatic number and girth	1975	Roger Cook
+	Rank and Chromatic Number	1992	Cyriel van Nuffelen
+	The chromatic polynomial	2016	Jan Draisma
+ PDF Chat	Chromatic Numbers of Simplicial Manifolds	2019	Frank H. Lutz Jesper M. Møller
+	Proofs on the Kneser-Poulsen Conjecture	2019	Károly Bezdek Zsolt Lángi
+	A lower bound on the Chromatic Number by Simplicial Complexes	2017	L. Folkersma
+ PDF Chat	Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz	2013	Jacob Fox Choongbum Lee Benny Sudakov
+	On the b-chromatic number of Kneser graphs	2009	Hossein Hajiabolhassan
+	Bounds for the Chromatic Number	2008
+	Bounds for the Chromatic Number	2008
+	Bounds for the Chromatic Number	2019	Gary Chartrand Ping Zhang
+ PDF Chat	The Distinguishing Number and Distinguishing Chromatic Number for Posets	2021	Karen L. Collins Ann N. Trenk
+	The chromatic polynomial	1974	Norman Biggs

Action	Title	Year	Authors
+	Cycles in Sparse Graphs II	2010	Jacques Verstraëte Benny Sudakov
+	On Coloring Properties of Graph Powers	2011	Hossein Hajiabolhassan Ali Taherkhani
+	The Neighbourhood Polynomial of some Nanostructures	2014	‎Saeid Alikhani Mahmoudi Eisa
+ PDF Chat	Generalized Kneser coloring theorems with combinatorial proofs	2002	Günter M. Ziegler
+ PDF Chat	The chromatic number of almost stable Kneser hypergraphs	2011	Frédéric Meunier
+ PDF Chat	On the chromatic number of general Kneser hypergraphs	2015	Meysam Alishahi Hossein Hajiabolhassan
+ PDF Chat	The p-restricted edge-connectivity of Kneser graphs	2018	C. Balbuena X. Marcote
+	The neighborhood complexes of almost <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e436" altimg="si8.gif"><mml:mi>s</mml:mi></mml:math>-stable Kneser graphs	2018	József Osztényi
+ PDF Chat	Extremal G-free induced subgraphs of Kneser graphs	2018	Meysam Alishahi Ali Taherkhani
+ PDF Chat	On the generalized Erdős–Kneser conjecture: Proofs and reductions	2018	Jai Aslam Shuli Chen Ethan Coldren Florian Frick Linus Setiabrata

Action	Title	Year	Authors
+ PDF Chat	On chromatic number of graphs and set systems	1973	Paul Erdös A. Hajnal B. Rothchild
+ PDF Chat	The Complexity of Near-Optimal Graph Coloring	1976	M. R. Garey David S. Johnson
+	n-Tuple colorings and associated graphs	1976	Saul Stahl
+ PDF Chat	On chromatic number of graphs and set-systems	1966	Péter L. Erdős A. Hajnal
+ PDF Chat	Drei Sätze über die n-dimensionale euklidische Sphäre	1933	Karol Borsuk