Equivariant Cohomology and Lower Bounds for Chromatic Numbers

DOI10.2307/2154049zbMATH Open0756.05055OpenAlexW4249922773MaRDI QIDQ4015877FDOQ4015877

Authors Igor Kriz

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

zbMATH Keywords

lower boundsequivariant cohomologychromatic numbers

Mathematics Subject Classification ID

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)

• On the chromatic number of general Kneser hypergraphs
• On generalized Kneser hypergraph colorings
• Lower bounds for the chromatic number of certain Kneser-type hypergraphs
• On the van Kampen-Flores theorem
• Box complexes, neighborhood complexes, and the chromatic number
• Tverberg’s theorem is 50 years old: A survey
• The genus of \(G\)-spaces and topological lower bounds for chromatic numbers of hypergraphs
• Colorful subhypergraphs in Kneser hypergraphs
• Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
• On the chromatic number of Kneser hypergraphs
• Local chromatic number and distinguishing the strength of topological obstructions
• scientific article; zbMATH DE number 5222564 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• Random Kneser graphs and hypergraphs
• Topological bounds on the dimension of orthogonal representations of graphs
• Hadwiger's conjecture and topological bounds
• A new lower bound for the chromatic number of general Kneser hypergraphs
• Altermatic number of categorical product of graphs
• Intersection patterns of finite sets and of convex sets
• Coloring properties of categorical product of general Kneser hypergraphs
• A combinatorial proof for the circular chromatic number of Kneser graphs
• On finding constrained independent sets in cycles
• Hedetniemi's conjecture for Kneser hypergraphs
• Colorful subhypergraphs in uniform hypergraphs
• WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
• Chromatic number of random Kneser hypergraphs

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)