Radon numbers grow linearly
From MaRDI portal
Publication:2671172
DOI10.1007/s00454-021-00331-2OpenAlexW3197003642MaRDI QIDQ2671172
Publication date: 3 June 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.02239
Discrete geometry (52Cxx) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Graph theory (05Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative combinatorial geometry for continuous parameters
- Radon numbers for trees
- Partition numbers for trees and ordered sets
- A generalization of Caratheodory's theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- The partition conjecture
- Transversal numbers for hypergraphs arising in geometry
- Radon numbers and the fractional Helly theorem
- On weak \(\epsilon\)-nets and the Radon number
- Large cliques in hypergraphs with forbidden substructures
- Tverberg partitions as weak epsilon-nets
- Quantitative Tverberg theorems over lattices and other discrete sets
- Tensors, colours, octahedra
- A Problem of Geometry in R n
- Point Selections and Weak ε-Nets for Convex Hulls
- Tverberg’s theorem is 50 years old: A survey
- Tverberg theorems over discrete sets of points
- A Generalization of Radon's Theorem
- Some Elementary Properties of Interval Convexities
This page was built for publication: Radon numbers grow linearly
