Tverberg's theorem and graph coloring
From MaRDI portal
Publication:2441583
DOI10.1007/s00454-013-9556-3zbMath1284.05097arXiv1105.1455OpenAlexW2055467352MaRDI QIDQ2441583
Alexander Engström, Patrik Noren
Publication date: 25 March 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.1455
Related Items
Cites Work
- Unnamed Item
- A local criterion for Tverberg graphs
- On the number of Tverberg partitions in the prime power case
- Tverberg's theorem with constraints
- Algebraic properties of edge ideals via combinatorial topology
- Shellability of chessboard complexes
- On a topological generalization of the Tverberg theorem
- The associahedron and triangulations of the \(n\)-gon
- Simplicial complexes of graphs
- Independence complexes of claw-free graphs
- The Difference Between Consecutive Primes, II
- On a Topological Generalization of a Theorem of Tverberg
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- A Generalization of Radon's Theorem