Pages that link to "Item:Q3941977"

The following pages link to A Lower Bound for Heilbronn'S Problem (Q3941977):

Displaying 37 items.

• Large triangles in the \(d\)-dimensional unit cube (Q860817) (← links)
• On a Heilbronn-type problem (Q932652) (← links)
• Distributions of points in \(d\) dimensions and large \(k\) -point simplices (Q958238) (← links)
• Point sets in the unit square and large areas of convex hulls of subsets of points (Q1016043) (← links)
• On sets of points that determine only acute angles (Q1024284) (← links)
• Generalizations of Heilbronn's triangle problem (Q1039441) (← links)
• On distinct distances among points in general position and other related problems (Q1046803) (← links)
• On triangulations of the convex hull of n points (Q1062014) (← links)
• Partitions of planar sets into small triangles (Q1074866) (← links)
• Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
• On a generalization of Polya inequality and some of its statistical implications (Q1612293) (← links)
• Additive combinatorics and graph theory (Q1620873) (← links)
• \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
• Sparse hypergraphs with low independence number (Q1705800) (← links)
• The on-line Heilbronn's triangle problem (Q1827762) (← links)
• Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
• Simplex range reporting on a pointer machine (Q1917035) (← links)
• Arcs in \(\mathbb{F}_q^2\) (Q2136192) (← links)
• Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437) (← links)
• Distributions of points in the unit square and large \(k\)-gons (Q2427543) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Lower Bounds on the Complexity of Polytope Range Searching (Q3471697) (← links)
• Generalizations of Heilbronn's Triangle Problem (Q3503518) (← links)
• Convex bodies, economic cap coverings, random polytopes (Q3828623) (← links)
• The average‐case area of Heilbronn‐type triangles* (Q4543628) (← links)
• The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i>²/log <i>t</i> (Q4851927) (← links)
• On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
• On the Independence Number of Steiner Systems (Q4911171) (← links)
• Pseudorandom hypergraph matchings (Q4993112) (← links)
• Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
• On independent sets in hypergraphs (Q5409863) (← links)
• Heilbronn triangle‐type problems in the unit square [0,1]² (Q6074876) (← links)
• Heilbronn's problem of eight points in the square (Q6076812) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• Upper bounds for Heilbronn's triangle problem in higher dimensions (Q6499407) (← links)
• On Heilbronn triangle-type problems in higher dimensions (Q6621159) (← links)
• Note on disjoint faces in simple topological graphs (Q6661600) (← links)