On Grids in Point-Line Arrangements in the Plane

DOI10.4230/LIPIcs.SoCG.2019.50OpenAlexW2963693980MaRDI QIDQ5088982

Andrew Suk, Mozhgan Mirzaei

Publication date: 18 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10454/pdf/LIPIcs-SoCG-2019-50.pdf/

zbMATH Keywords

Sidon setsgridsSzemerédi-Trotter theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Hasse diagrams with large chromatic number

Cites Work

• Unnamed Item
• \(k\)-fold Sidon sets
• Extremal problems in discrete geometry
• Efficient partition trees
• Crossing families
• On hypergraphs of girth five
• A center transversal theorem for hyperplanes and applications to graph drawing
• A decomposition theorem for partially ordered sets
• Space Crossing Numbers
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
• Extremal problems for cycles in graphs
• Research Problems in Discrete Geometry
• Overlap properties of geometric expanders
• Solving a linear equation in a set of integers I
• Dense Arrangements are Locally Very Dense. I
• On a problem of K. Zarankiewicz
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: On Grids in Point-Line Arrangements in the Plane