Generalizations of Heilbronn's Triangle Problem

DOI10.1016/j.endm.2007.07.088zbMath1341.05180OpenAlexW1981179248MaRDI QIDQ3503518

Hanno Lefmann

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.088

zbMATH Keywords

independence numberhypergraphslarge simplices

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Extremal uncrowded hypergraphs
• A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
• Lower Bounds on the Complexity of Polytope Range Searching
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• The Algorithmic Aspects of Uncrowded Hypergraphs
• On uncrowded hypergraphs
• On a Problem of Heilbronn†
• Computing and Combinatorics