Large triangles in the \(d\)-dimensional unit cube

DOI10.1016/j.tcs.2006.06.010zbMath1110.68109OpenAlexW2090152289MaRDI QIDQ860817

Hanno Lefmann

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.010

zbMATH Keywords

hypergraphsindependent setsHeilbronn problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

\(\alpha\)-concave hull, a generalization of convex hull ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ Generalizations of Heilbronn's triangle problem

Cites Work

• Unnamed Item
• Extremal uncrowded hypergraphs
• Developments in Heilbronn's triangle problem
• The on-line Heilbronn's triangle problem
• On Heilbronn's problem in higher dimension
• A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• The Algorithmic Aspects of Uncrowded Hypergraphs
• An Algorithm for Heilbronn's Problem
• The average‐case area of Heilbronn‐type triangles*
• On uncrowded hypergraphs
• A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
• Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• On a Problem of Heilbronn†
• On a Problem of Heilbronn, II
• On a Problem of Heilbronn, III
• On a Problem of Heilbronn

This page was built for publication: Large triangles in the \(d\)-dimensional unit cube