Intersection patterns of finite sets and of convex sets
From MaRDI portal
Publication:2980804
Abstract: The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverberg-type theory, which is concerned with the intersection pattern of faces in a simplicial complex when continuously mapped to Euclidean space. As an application we get a simple proof of a generalization of a result of Kriz for certain parameters. This specializes to a short and simple proof of Kneser's conjecture. Moreover, combining this result with recent work of Mabillard and Wagner we show that the existence of certain equivariant maps yields lower bounds for chromatic numbers. We obtain an essentially elementary proof of the result of Schrijver on the chromatic number of stable Kneser graphs. In fact, we show that every neighborly even-dimensional polytope yields a small induced subgraph of the Kneser graph of the same chromatic number. We furthermore use this geometric viewpoint to give tight lower bounds for the chromatic number of certain small subhypergraphs of Kneser hypergraphs.
Recommendations
- Chromatic numbers of stable Kneser hypergraphs via topological Tverberg-type theorems
- On the chromatic number of general Kneser hypergraphs
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
- scientific article; zbMATH DE number 4075095
- Topological lower bounds for the chromatic number: a hierarchy
Cites work
- scientific article; zbMATH DE number 3672329 (Why is no real title available?)
- scientific article; zbMATH DE number 3561377 (Why is no real title available?)
- scientific article; zbMATH DE number 718867 (Why is no real title available?)
- scientific article; zbMATH DE number 3223483 (Why is no real title available?)
- A Generalization of Radon's Theorem
- A Generalized van Kampen-Flores Theorem
- A New Short Proof of Kneser's Conjecture
- A certain combinatorial inequality
- A combinatorical proof of Kneser's conjecture
- A generalized Kneser conjecture
- A short proof of Kneser's conjecture
- Barycenters of polytope skeleta and counterexamples to the topological Tverberg conjecture, via constraints
- Eliminating higher-multiplicity intersections. II. The deleted product criterion in the \(r\)-metastable range
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- Generalized Kneser coloring theorems with combinatorial proofs
- Higher-dimensional cluster combinatorics and representation theory
- Higherdimensional analogues of Császár's torus
- Kneser's conjecture, chromatic number, and homotopy
- Many neighborly polytopes and oriented matroids
- Neighborly polytopes
- Nerve complexes of circular arcs
- On a Topological Generalization of a Theorem of Tverberg
- On a common generalization of Borsuk's and Radon's theorem
- On generalized Kneser hypergraph colorings
- On the chromatic number of Kneser hypergraphs
- On the chromatic number of general Kneser hypergraphs
- On the van Kampen-Flores theorem
- Optimal bounds for the colored Tverberg problem
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- The Chromatic Number of Kneser Hypergraphs
- The chromatic number of almost stable Kneser hypergraphs
- The colored Tverberg's problem and complexes of injective functions
- Tverberg plus constraints
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Cited in
(13)- scientific article; zbMATH DE number 4075095 (Why is no real title available?)
- Fair splittings by independent sets in sparse graphs
- Intersection patterns of linear subspaces with the hypercube
- Finite sets and symmetric simplicial sets
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Tverberg’s theorem is 50 years old: A survey
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- On the number of star‐shaped classes in optimal colorings of Kneser graphs
- scientific article; zbMATH DE number 5300360 (Why is no real title available?)
- Intersection Disjunctions for Reverse Convex Sets
- Intersection patterns of convex sets
- Finite sets as complements of finite unions of convex sets
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
This page was built for publication: Intersection patterns of finite sets and of convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980804)
