A Generalization of Radon's Theorem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Tverberg's theorem, disks, and Hamiltonian cycles
- Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes
- Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
- A local criterion for Tverberg graphs
- The Tverberg-Vrećica problem and the combinatorial geometry on vector bundles
- No-dimensional Tverberg theorems and algorithms
- Tverberg numbers for cellular bipartite graphs
- Tverberg plus minus
- On the number of colored Birch and Tverberg partitions
- A topological central point theorem
- A Tverberg type theorem for staircase convexity
- Tolerant Radon partitions on the all-paths convexity in graphs
- Barycenters of polytope skeleta and counterexamples to the topological Tverberg conjecture, via constraints
- Intersection patterns of finite sets and of convex sets
- Density and dimension
- Helly-type theorems for the diameter
- A geometric proof of the colored Tverberg theorem
- Theory of Quantum Error Correction for General Noise
- From word-representable graphs to altered Tverberg-type theorems
- Approximate centerpoints with proofs
- Regular polygonal partitions of a Tverberg type
- On a topological version of Pach's overlap theorem
- Intersecting diametral balls induced by a geometric graph
- Tverberg partition graphs
- On the number of Tverberg partitions in the prime power case
- On a common generalization of Borsuk's and Radon's theorem
- Partitions of points into simplices with k-dimensional intersection. I: The conic Tverberg's theorem
- Strong independence and the dimension of a Tverberg set
- A generalisation of Tverberg's theorem
- An upper bound on the \(P_3\)-Radon number
- Tverberg-type theorems for pseudoconfigurations of points in the plane
- Support vector machines and Radon's theorem
- Intersecting ellipses induced by a max-sum matching
- The topological Tverberg theorem and winding numbers
- A generalization of Caratheodory's theorem
- Quantitative combinatorial geometry for concave functions
- Dimension of the Radon set
- Network essence: PageRank completion and centrality-conforming Markov chains
- Tverberg-type theorems for intersecting by rays
- Tolerance for colorful Tverberg partitions
- The crossing Tverberg theorem
- On a topological generalization of the Tverberg theorem
- Piercing convex sets
- A Tverberg-type result on multicolored simplices
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- The colored Hadwiger transversal theorem in \(\mathbb{R}^d\)
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- Topology of geometric joins
- Radon numbers and the fractional Helly theorem
- The topological Tverberg theorem and related topics
- Tverberg plus constraints
- New lower bounds for Tverberg partitions with tolerance in the plane
- Quantitative Tverberg theorems over lattices and other discrete sets
- Radon numbers for trees
- Colourful linear programming
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Matching points with disks with a common intersection
- The ``quantum Turán problem for operator systems
- Carathéodory, Helly and the others in the max-plus world
- A Tverberg type theorem for matroids
- Tverberg's theorem and multi-class support vector machines
- Note on a conjecture of Sierksma
- Tverberg's theorem via number fields
- A note on the Tolerant Tverberg Theorem
- Counterexamples to the colorful Tverberg conjecture for hyperplanes
- Solving Malfatti's high dimensional problem by global optimization
- Tverberg theorems over discrete sets of points
- Analogues of the central point theorem for families with \(d\)-intersection property in \(\mathbb R^d\)
- Colored Tverberg theorem with new constraints on the faces
- The compatibility dimension of quantum measurements
- On construction of anticliques for noncommutative operator graphs
- Complex analogues of the Tverberg-Vrećica conjecture and central transversal theorems
- Projective center point and Tverberg theorems
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- A Radon theorem for Helly graphs
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
- A generalization of Radon's theorem II
- A Generalized van Kampen-Flores Theorem
- Helly-type problems
- Inscribed Tverberg‐type partitions for orbit polytopes
- Tverberg’s theorem is 50 years old: A survey
- Computational complexity of the -Ham-Sandwich problem
- The crossing Tverberg theorem
- Optimal bounds for the colored Tverberg problem
- Crossing-free perfect matchings in wheel point sets
- Topological methods in zero-sum Ramsey theory
- Tverberg-type theorems with altered intersection patterns (nerves)
- Transversals to the convex hulls of all k-sets of discrete subsets of R^n
- A ``quantum Ramsey theorem for operator systems
- Inapproximability results and bounds for the Helly and Radon numbers of a graph
- Intersecting diametral balls induced by a geometric graph. II
- A theorem on families of sets
- On weighted sums of numbers of convex polygons in point sets
- On maximum volume simplices in polytopes
- Multidimensional agreement in Byzantine systems
- Radon numbers grow linearly
- Algorithms for Radon partitions with tolerance
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- A topological product Tverberg theorem
- Centerpoints and Tverberg's technique
This page was built for publication: A Generalization of Radon's Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5339948)
