A Lower Bound for Heilbronn'S Problem

DOI10.1112/JLMS/S2-25.1.13MaRDI QIDQ3941977zbMATH OpenOpenAlexWikidataFDO

Authors János Komlós, János Pintz, Endre Szemerédi

Publication date 1982

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-25.1.13

zbMATH Keywords

configurationHeilbronn's conjectureHeilbronn's triangle problemhypergraphsprobabilistic construction

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Other problems of combinatorial convexity (52A37) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cited in

(45)

• Point sets in the unit square and large areas of convex hulls of subsets of points
• On sets of points that determine only acute angles
• Generalizations of Heilbronn's triangle problem
• On distinct distances among points in general position and other related problems
• On triangulations of the convex hull of n points
• Partitions of planar sets into small triangles
• Fractional v. integral covers in hypergraphs of bounded edge size
• On a generalization of Polya inequality and some of its statistical implications
• Additive combinatorics and graph theory
• \(\alpha\)-concave hull, a generalization of convex hull
• Sparse hypergraphs with low independence number
• The on-line Heilbronn's triangle problem
• Coloring face-hypergraphs of graphs on surfaces
• Simplex range reporting on a pointer machine
• Arcs in \(\mathbb{F}_q^2\)
• Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
• Distributions of points in the unit square and large \(k\)-gons
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Lower Bounds on the Complexity of Polytope Range Searching
• Generalizations of Heilbronn's Triangle Problem
• Convex bodies, economic cap coverings, random polytopes
• The average‐case area of Heilbronn‐type triangles*
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On Brooks' Theorem for Sparse Graphs
• On the independence number of Steiner systems
• Pseudorandom hypergraph matchings
• Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
• On independent sets in hypergraphs
• Heilbronn triangle‐type problems in the unit square [0,1]²
• Heilbronn's problem of eight points in the square
• Graph and hypergraph colouring via nibble methods: a survey
• Upper bounds for Heilbronn's triangle problem in higher dimensions
• On Heilbronn triangle-type problems in higher dimensions
• Note on disjoint faces in simple topological graphs
• Small triangles
• Geometric constructions for Ramsey-Turán theory
• Independent sets in hypergraphs
• Disjoint faces in drawings of the complete graph and topological Heilbronn problems
• Coloring simple hypergraphs
• Lower bounds for incidences
• The number of cliques in hypergraphs with forbidden subgraphs
• Combinatorics. Abstracts from the workshop held January 4--9, 2026
• Large triangles in the \(d\)-dimensional unit cube
• On a Heilbronn-type problem
• Distributions of points in \(d\) dimensions and large \(k\) -point simplices

This page was built for publication: A Lower Bound for Heilbronn'S Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3941977)