Intersection theorems for triangles

DOI10.1007/s00454-021-00295-3zbMath1497.05252arXiv2009.14560OpenAlexW3156574086MaRDI QIDQ2172651

Andrey B. Kupavskii, Andreas F. Holmsen, Peter Frankl

Publication date: 16 September 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.14560

zbMATH Keywords

geometric set systemsintersecting trianglesextremal hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Combinatorial complexity of geometric structures (52C45)

Cites Work

• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• 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
• The Erdős-Ko-Rado theorem for vector spaces
• A generalization of Caratheodory's theorem
• Intersection theorems for systems of finite vector spaces
• On the maximum number of permutations with given maximal or minimal distance
• A point in many triangles
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A continuous analogue of the upper bound theorem

This page was built for publication: Intersection theorems for triangles