Intersecting diametral balls induced by a geometric graph. II

DOI10.1016/j.disc.2023.113694zbMath1525.05152arXiv2303.10706MaRDI QIDQ6080152

Polina Barabanshchikova, Aleksandr A. Polyanskii

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.10706

zbMATH Keywords

convex optimizationTverberg theoremalternating cycleinfinite descentmax-sum matchingmax-sum tree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Erd?s problems and related topics of discrete geometry (52C10) Helly-type theorems and geometric transversal theory (52A35)

Related Items (1)

Center of maximum-sum matchings of bichromatic points

Cites Work

• Tverberg's theorem, disks, and Hamiltonian cycles
• Matching points with disks with a common intersection
• On maximum-sum matchings of points
• Quantitative Helly-Type Theorems
• A Generalization of Radon's Theorem

This page was built for publication: Intersecting diametral balls induced by a geometric graph. II