Kneser's conjecture, chromatic number, and homotopy
From MaRDI portal
Publication:755592
DOI10.1016/0097-3165(78)90022-5zbMath0418.05028WikidataQ29308588 ScholiaQ29308588MaRDI QIDQ755592
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90022-5
05C15: Coloring of graphs and hypergraphs
Related Items
On the chromatic number of Kneser hypergraphs, Topological obstructions to graph colorings, On graphs with strongly independent color-classes, CORES OF SYMMETRIC GRAPHS, Tight LP‐based lower bounds for wavelength conversion in optical networks, Equipartitions of measures in $\mathbb{R}^4$, Quadratic forms on graphs, Some remarks on Hajós' conjecture, A generalized Kneser conjecture, Covering radius and the chromatic number of Kneser graphs, Colouring lines in projective space, 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, Topology and combinatorics of partitions of masses by hyperplanes, The neighborhood complex of a random graph, Density and power graphs in graph homomorphism problem, Non-cover generalized Mycielski, Kneser, and Schrijver graphs, Homotopy types of box complexes, The genus of \(G\)-spaces and topological lower bounds for chromatic numbers of hypergraphs, Local coloring of Kneser graphs, Hom complexes and homotopy theory in the category of graphs, Topological obstructions for vertex numbers of Minkowski sums, Homotopy groups of Hom complexes of graphs, Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\), Combinatorial groupoids, cubical complexes, and the Lovász Conjecture, Colorful flowers, Large disjoint subgraphs with the same order and size, Vizing's conjecture for chordal graphs, Graph colorings, spaces of edges and spaces of circuits, On colorings of graph powers, On \(b\)-coloring of the Kneser graphs, A generalization of the Erdős-Ko-Rado theorem, Extremal problems concerning Kneser-graphs, Hamiltonian uniform subset graphs, Large independent sets in shift-invariant graphs, A class of additive multiplicative graph functions, The chromatic connectivity of graphs, The complexity of multicolouring, Maximum bipartite subgraphs of Kneser graphs, On constructive methods in the theory of colour-critical graphs, On locally-perfect colorings, A certain combinatorial inequality, A combinatorial proof of the Borsuk-Ulam antipodal point theorem, A note on induced cycles in Kneser graphs, The colored Tverberg's problem and complexes of injective functions, A generalization of the ham sandwich theorem, Helly property in finite set systems, A short proof of Kneser's conjecture, Long induced paths and cycles in Kneser graphs, The algebra of flows in graphs, Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François), Strong products of Kneser graphs, A problem of Füredi and Seymour on covering intersecting families by pairs, The order dimension of two levels of the Boolean lattices, Tiling Hamming space with few spheres, Circular chromatic number of Kneser graphs, Vertex embeddings of regular polytopes, Graph products and the chromatic difference sequence of vertex-transitive graphs, The multichromatic numbers of some Kneser graphs, On endo-homology of complexes of graphs, Resource-sharing system scheduling and circular chromatic number, Stable sets of maximal size in Kneser-type graphs, NP-completeness of a family of graph-colouring problems, Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini, From graphs to ortholattices and equivariant maps, Nearly bipartite graphs with large chromatic number, 4-chromatic graphs with large odd girth, Transversal numbers for hypergraphs arising in geometry, Covering by intersecting families, Box complexes, neighborhood complexes, and the chromatic number, Coloring graph products---a survey, Circular colouring and algebraic no-homomorphism theorems, Complexes of graph homomorphisms, Linear colorings of simplicial complexes and collapsing, On the chromatic number of some geometric type Kneser graphs, The geometry and topology of reconfiguration, Colorful subgraphs in Kneser-like graphs, Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\), Chromatic capacity and graph operations, The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics, Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes, Independence and coloring properties of direct products of some vertex-transitive graphs, WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences, A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex, On the diameter of Kneser graphs, Fractional chromatic numbers of cones over graphs, The existence of a near-unanimity term in a finite algebra is decidable, Colinear Coloring on Graphs, Local chromatic number and distinguishing the strength of topological obstructions, Homology as a Tool in Integer Programming, Unnamed Item, The Chromatic Number of Kneser Hypergraphs, Borsuk's theorem through complementary pivoting
Cites Work
