On the structure of pointsets with many collinear triples
From MaRDI portal
Publication:6624189
DOI10.1007/S00454-023-00579-WMaRDI QIDQ6624189
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small cores in 3-uniform hypergraphs
- On sets defining few ordinary lines
- Many collinear \(k\)-tuples with no \(k+1\) collinear points
- Uniform hypergraphs containing no grids
- On convex hull of points on modular hyperbolas
- A new proof of the graph removal lemma
- On the existence of dense substructures in finite groups
- Planar configurations which determine few slopes
- On linear combinatorics. III: Few directions and distorted lattices
- 2N noncollinear points determine at least 2N directions
- On some problems of elementary and combinatorial geometry
- On linear combinatorics. I: Concurrency---an algebraic approach
- On the number of slopes of the graph of a function defined on a finite field
- Crossing families
- Around Rédei's theorem
- On the number of directions determined by a set of points in an affine Galois plane
- Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
- Planar point sets determine many pairwise crossing segments
- On the directions determined by a Cartesian product in an affine Galois plane
- A new bound for the Brown-Erdős-Sós problem
- A positive fraction mutually avoiding sets theorem
- The Brown-Erdős-Sós conjecture in finite abelian groups
- Solution of Scott's problem on the number of directions determined by a point set in 3-space
- On the existence of triangulated spheres in 3-graphs, and related problems
- A survey of Sylvester's problem and its generalizations
- Note on the Braikenridge-Maclaurin theorem
- Problem Collection of the DIMANET Mátraháza Workshop, 22–28 October 1995
- Rank bounds for design matrices with block entries and geometric applications
- Proof of the Brown–Erdős–Sós conjecture in groups
- A note on the Brown–Erdős–Sós conjecture in groups
- Constructing dense grid-free linear $3$-graphs
- The (7, 4)-Conjecture in Finite Groups
- Dense Arrangements are Locally Very Dense. I
- On a problem of K. Zarankiewicz
- Proofs from THE BOOK
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)