Polytopes with large transversal ratio
Michael Gene Dobbins, Seunghun Lee

TL;DR
This paper constructs an infinite family of high-dimensional polytopes with a transversal ratio approaching 1, demonstrating that their weak chromatic number is unbounded for dimensions five and higher.
Contribution
It introduces a new family of polytopes with large transversal ratios, improving previous lower bounds and showing unbounded weak chromatic numbers in higher dimensions.
Findings
Transversal ratio approaches 1 for the constructed polytopes.
Weak chromatic number is unbounded for all dimensions ≥ 5.
Improves previous lower bounds on transversal ratios.
Abstract
The transversal ratio of a polytope is the minimum proportion of vertices of required to intersect each facet of . The weak chromatic number of is the minimum number of colors required to color the vertices of so that no facet is monochromatic. We will construct an infinite family of -polytopes for each whose transversal ratio approaches 1 as the number of vertices grows. In particular, this implies that the weak chromatic number for -polytopes is unbounded for each . The previous best known lower bounds on the supremum of the transversal ratio for -polytopes for were 2/5 for odd by Novik and Zheng, and 1/2 for even by Holmsen, Pach, and Tverberg. In the case of simplicial -spheres, the best known lower bounds were 1/2 for and for by Novik and Zheng.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Computational Geometry and Mesh Generation · Advanced Graph Theory Research
