On the number of points in general position in the plane
From MaRDI portal
Publication:4645041
DOI10.19086/da.4438zbMath1404.52016arXiv1704.05089OpenAlexW3098403304WikidataQ129141879 ScholiaQ129141879MaRDI QIDQ4645041
József Balogh, József Solymosi
Publication date: 9 January 2019
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05089
Related Items (6)
Arcs in \(\mathbb{F}_q^2\) ⋮ Four‐term progression free sets with three‐term progressions in all large subsets ⋮ Integer colorings with forbidden rainbow sums ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ An efficient container lemma ⋮ A new lower bound on Hadwiger-Debrunner numbers in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on coloring line arrangements
- A new proof of the density Hales-Jewett theorem
- A random version of Sperner's theorem
- Szemerédi-Trotter-type theorems in dimension 3
- A non-linear lower bound for planar epsilon-nets
- An exponential-type upper bound for Folkman numbers
- A density version of the Hales-Jewett theorem for \(k=3\)
- On some metric and combinatorial geometric problems
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- Sharp bound on the number of maximal sum-free subsets of integers
- A density version of the Hales-Jewett theorem
- Maximum-size antichains in random set-systems
- Density Hales-Jewett and Moser numbers
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- The Number of Subsets of Integers with Nok-Term Arithmetic Progression
- Tight lower bounds for the size of epsilon-nets
- Independent sets in hypergraphs
- A Short Proof of the Random Ramsey Theorem
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Indecomposable Coverings
This page was built for publication: On the number of points in general position in the plane
