Construction of Locally Plane Graphs with Many Edges

DOI10.1007/978-1-4614-0110-0_29zbMath1272.05035arXiv1110.6482OpenAlexW1525531059MaRDI QIDQ2847926

Gábor Tardos

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.6482

zbMATH Keywords

geometric graphstraight-line edgesedge colored bipartite graphslocally plane graphsrandomized thinnening proceduressuperlinear number of edges

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

On the maximum number of edges in quasi-planar graphs ⋮ Ordered and convex geometric trees with linear extremal function ⋮ Turán problems for edge-ordered graphs ⋮ Quantitative Restrictions on Crossing Patterns

This page was built for publication: Construction of Locally Plane Graphs with Many Edges