Intersecting diametral balls induced by a geometric graph
DOI10.1007/s00454-022-00457-xarXiv2108.09795MaRDI QIDQ6151026
Alexey Vasilevskii, Aleksandr A. Polyanskii, Olimjoni Pirahmad
Publication date: 9 February 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09795
Hamiltonian cyclegeometric graphperfect matchingTverberg's theoremhalving linealternating cycleinfinite descent\(\alpha\)-lensearrangements of convex bodiesred-blue matching
Planar graphs; geometric and topological aspects of graph theory (05C10) Metric geometry (51F99) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other problems of combinatorial convexity (52A37) Helly-type theorems and geometric transversal theory (52A35) Eulerian and Hamiltonian graphs (05C45) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing Hamiltonian cycles with no large angles
- Positive-fraction intersection results and variations of weak epsilon-nets
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Tverberg's theorem, disks, and Hamiltonian cycles
- Covering with Euclidean boxes
- An extension of the Erdős-Szekeres theorem on large angles
- Alternating cycles in edge-partitioned graphs
- On generalizations of Radon's theorem and the Ham sandwich theorem
- Optimal bounds for the colored Tverberg problem
- Matching points with disks with a common intersection
- On maximum-sum matchings of points
- A Colored Version of Tverberg's Theorem
- ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY
- A survey of mass partitions
- A Generalization of Radon's Theorem
- Pairwise intersecting homothets of a convex body
- Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
This page was built for publication: Intersecting diametral balls induced by a geometric graph
