Tverberg's theorem, disks, and Hamiltonian cycles
From MaRDI portal
Publication:825963
DOI10.1007/s00026-021-00557-0zbMath1483.52014arXiv2011.12218OpenAlexW3205921174WikidataQ114231905 ScholiaQ114231905MaRDI QIDQ825963
Publication date: 18 December 2021
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.12218
Erd?s problems and related topics of discrete geometry (52C10) Eulerian and Hamiltonian graphs (05C45)
Related Items
On maximum-sum matchings of points, Intersecting diametral balls induced by a geometric graph. II, Intersecting diametral balls induced by a geometric graph, Intersecting ellipses induced by a max-sum matching, Counterexamples to the colorful Tverberg conjecture for hyperplanes
Cites Work
- Unnamed Item
- Positive-fraction intersection results and variations of weak epsilon-nets
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Covering with Euclidean boxes
- An extension of the Erdős-Szekeres theorem on large angles
- Optimal bounds for the colored Tverberg problem
- Matching points with disks with a common intersection
- Tverberg plus constraints
- Tverberg's Theorem at 50: Extensions and Counterexamples
- A Colored Version of Tverberg's Theorem
- Tverberg’s theorem is 50 years old: A survey
- A Generalization of Radon's Theorem
