On the structure of pointsets with many collinear triples

DOI10.1007/S00454-023-00579-WMaRDI QIDQ6624189zbMATH OpenFDO

Publication date 25 October 2024

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00454-023-00579-W

collinear triples point-line incidences pointsets determining few directions

Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Recommendations

A structural theorem for sets with few triangles
On sets defining few ordinary lines
On triple lines and cubic curves: the orchard problem revisited
Many collinear k-tuples with no k+1 collinear points
On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points

Cites work

2N noncollinear points determine at least 2N directions
A new bound for the Brown-Erdős-Sós problem
A new proof of the graph removal lemma
A note on the Brown-Erdős-Sós conjecture in groups
A positive fraction mutually avoiding sets theorem
A survey of Sylvester's problem and its generalizations
Around Rédei's theorem
Constructing dense grid-free linear 3-graphs
Crossing families
Dense Arrangements are Locally Very Dense. I
scientific article; zbMATH DE number 3779340 (Why is no real title available?)
scientific article; zbMATH DE number 3609704 (Why is no real title available?)
scientific article; zbMATH DE number 1943961 (Why is no real title available?)
scientific article; zbMATH DE number 970816 (Why is no real title available?)
Many collinear k-tuples with no k+1 collinear points
Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
Note on the Braikenridge-Maclaurin theorem
On a problem of K. Zarankiewicz
On convex hull of points on modular hyperbolas
On linear combinatorics. I: Concurrency---an algebraic approach
On linear combinatorics. III: Few directions and distorted lattices
On sets defining few ordinary lines
On some problems of elementary and combinatorial geometry
On the directions determined by a Cartesian product in an affine Galois plane
On the existence of dense substructures in finite groups
On the existence of triangulated spheres in 3-graphs, and related problems
On the number of directions determined by a set of points in an affine Galois plane
On the number of slopes of the graph of a function defined on a finite field
Planar configurations which determine few slopes
Problem Collection of the DIMANET Mátraháza Workshop, 22–28 October 1995
Proof of the Brown-Erdős-Sós conjecture in groups
Proofs from THE BOOK
Rank bounds for design matrices with block entries and geometric applications
Small cores in 3-uniform hypergraphs
Solution of Scott's problem on the number of directions determined by a point set in 3-space
The (7, 4)-Conjecture in Finite Groups
The Brown-Erdős-Sós conjecture in finite abelian groups
Uniform hypergraphs containing no grids

Cited in

(1)

A structural theorem for sets with few triangles

This page was built for publication: On the structure of pointsets with many collinear triples

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