A Lower Bound for Heilbronn'S Problem

DOI10.1112/jlms/s2-25.1.13zbMath0483.52008OpenAlexW2093784222WikidataQ56446512 ScholiaQ56446512MaRDI QIDQ3941977

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

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

configurationhypergraphsHeilbronn's triangle problemprobabilistic constructionHeilbronn's conjecture

Mathematics Subject Classification ID

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

Related Items

Additive combinatorics and graph theory, Arcs in \(\mathbb{F}_q^2\), The average‐case area of Heilbronn‐type triangles*, Fractional v. integral covers in hypergraphs of bounded edge size, Large triangles in the \(d\)-dimensional unit cube, Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing, Simplex range reporting on a pointer machine, \(\alpha\)-concave hull, a generalization of convex hull, The Ramsey number R(3, t) has order of magnitude t²/log t, On Brooks' Theorem for Sparse Graphs, Heilbronn triangle‐type problems in the unit square [0,1²], Heilbronn's problem of eight points in the square, Generalizations of Heilbronn's Triangle Problem, Graph and hypergraph colouring via nibble methods: a survey, Distributions of points in the unit square and large \(k\)-gons, Sparse hypergraphs with low independence number, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On a Heilbronn-type problem, On the Independence Number of Steiner Systems, On independent sets in hypergraphs, Convex bodies, economic cap coverings, random polytopes, Distributions of points in \(d\) dimensions and large \(k\) -point simplices, Lower Bounds on the Complexity of Polytope Range Searching, Lower bounds on the complexity of simplex range reporting on a pointer machine, 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, The on-line Heilbronn's triangle problem, Pseudorandom hypergraph matchings, Generalizations of Heilbronn's triangle problem, On distinct distances among points in general position and other related problems, Coloring face-hypergraphs of graphs on surfaces, On triangulations of the convex hull of n points, Partitions of planar sets into small triangles, On a generalization of Polya inequality and some of its statistical implications