The Number of Edges in k-Quasi-planar Graphs
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is O(n). The best known upper bound is n(log n)[superscript O(lo...
Main Authors: | Fox, Jacob (Contributor), Suk, Andrew (Contributor), Pach, Janos (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2013-07-18T15:24:03Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
String graphs and incomparability graphs
by: Fox, Jacob, et al.
Published: (2015) -
On grids in topological graphs
by: Ackerman, Eyal, et al.
Published: (2017) -
Applications of a New Separator Theorem for String Graphs
by: Fox, Jacob, et al.
Published: (2015) -
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
by: Borodin Oleg V., et al.
Published: (2013-09-01) -
A graph theoretical analysis of the number of edges in k-dense graphs
by: Linda Eroh, et al.
Published: (2016-04-01)