Equivariant Cohomology and Lower Bounds for Chromatic Numbers
DOI10.2307/2154049zbMATH Open0756.05055OpenAlexW4249922773MaRDI QIDQ4015877FDOQ4015877
Publication date: 7 December 1992
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2154049
Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Equivariant homology and cohomology in algebraic topology (55N91) Applied homological algebra and category theory in algebraic topology (55U99) Spectral sequences in algebraic topology (55T99)
Cited In (26)
- Lower bounds for the chromatic number of certain Kneser-type hypergraphs
- Box complexes, neighborhood complexes, and the chromatic number
- Coloring properties of categorical product of general Kneser hypergraphs
- Hedetniemi's conjecture for Kneser hypergraphs
- Colorful subhypergraphs in Kneser hypergraphs
- Intersection patterns of finite sets and of convex sets
- Chromatic number of random Kneser hypergraphs
- On the chromatic number of general Kneser hypergraphs
- On generalized Kneser hypergraph colorings
- Kneser's conjecture, chromatic number, and homotopy
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Hadwiger's conjecture and topological bounds
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Tverberg’s theorem is 50 years old: A survey
- On the chromatic number of Kneser hypergraphs
- A new lower bound for the chromatic number of general Kneser hypergraphs
- On the van Kampen-Flores theorem
- Title not available (Why is that?)
- Topological bounds on the dimension of orthogonal representations of graphs
- Colorful subhypergraphs in uniform hypergraphs
- Local chromatic number and distinguishing the strength of topological obstructions
- Random Kneser graphs and hypergraphs
- Altermatic number of categorical product of graphs
- The genus of \(G\)-spaces and topological lower bounds for chromatic numbers of hypergraphs
- On finding constrained independent sets in cycles
This page was built for publication: Equivariant Cohomology and Lower Bounds for Chromatic Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015877)
