A new lower bound based on Gromov's method of selecting heavily covered points
From MaRDI portal
(Redirected from Publication:452003)
Abstract: Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d n!/(d+1)!(n-d-1)! d-simplices with vertices at the points of P. Gromov improved the lower bound on c_d by topological means. Using methods from extremal combinatorics, we improve one of the quantities appearing in Gromov's approach and thereby provide a new stronger lower bound on c_d for arbitrary d. In particular, we improve the lower bound on c_3 from 0.06332 to more than 0.07480; the best upper bound known on c_3 being 0.09375.
Recommendations
Cites work
- A generalization of Caratheodory's theorem
- A point in many triangles
- A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
- Flag algebras
- Hypergraphs do jump
- Improving the first selection lemma in \(\mathbb{R}^3\)
- Limits of dense graph sequences
- Non-three-colourable common graphs exist
- On 3-hypergraphs with forbidden 4-vertex configurations
- On Gromov's method of selecting heavily covered points
- On the number of pentagons in triangle-free graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Stabbing simplices by points and flats
- The number of triangles covering the center of an \(n\)-set
Cited in
(27)- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- A proof of the Oja depth conjecture in the plane
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- On Gromov's method of selecting heavily covered points
- Upper bounds for stabbing simplices by a line
- Sharp bounds for decomposing graphs into edges and triangles
- Decomposing graphs into edges and triangles
- Closing in on Hill's conjecture
- \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
- A new bound for the 2/3 conjecture
- Maximum number of almost similar triangles in the plane
- Minimum number of edges that occur in odd cycles
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
- Finitely forcible graphons with an almost arbitrary structure
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons and permutons
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A note on lower bounds for colourful simplicial depth
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Inducibility of directed paths
- Finitely forcible graph limits are universal
- Rainbow triangles in three-colored graphs
- A slight improvement to the colored Bárány's theorem
- Compactness and finite forcibility of graphons
- Positive-fraction intersection results and variations of weak epsilon-nets
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
This page was built for publication: A new lower bound based on Gromov's method of selecting heavily covered points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452003)
