The crossing Tverberg theorem
From MaRDI portal
Publication:6624180
DOI10.1007/S00454-023-00532-XMaRDI QIDQ6624180
Radoslav Fulek, Andrey B. Kupavskii, Uli Wagner, B. Gärtner, Pavel Valtr
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Equal coefficients and tolerance in coloured Tverberg partitions
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Approximate centerpoints with proofs
- The colored Tverberg's problem and complexes of injective functions
- Crossing families
- Unavoidable configurations in complete topological graphs
- Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.
- Planar point sets determine many pairwise crossing segments
- Eliminating higher-multiplicity intersections. III. Codimension 2
- Unique end of potential line
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Optimal bounds for the colored Tverberg problem
- Eine Kennzeichnung des Kreises
- On the number of halving planes
- User's guide to equivariant methods in combinatorics. II
- Tverberg plus constraints
- On a Topological Generalization of a Theorem of Tverberg
- A Colored Version of Tverberg's Theorem
- The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- A user's guide to the topological Tverberg conjecture
- Tverberg’s theorem is 50 years old: A survey
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A Generalization of Radon's Theorem
- Approximating Tverberg points in linear time for any fixed dimension
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls
This page was built for publication: The crossing Tverberg theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624180)
