A linear edge bound for k-quasi-planar graphs
math.CO, cs.CG
Submitted: 2026-11-01
Updated: 2026-11-10
Comments: 6 pages, 1 figure
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- New bounds on the maximum number of edges in $k$-quasi-planar graphs
- Coloring curves that cross a fixed curve
- Quasiplanar Graphs, String Graphs, and the Erdos-Gallai Problem
- A parity Erd\H{o}s-Hajnal theorem for $t$-intersecting curves
- Cubical accessibility and bounds on curves on surfaces
- Resolutions of CAT(0) cube complexes and accessibility properties
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality