An upper bound on the number of edges in an almost planar bipartite graph

DOI10.1007/s10958-014-1690-9zbMath1298.05087arXiv1307.1013MaRDI QIDQ744552

D. Kharzeev

Publication date: 25 September 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

drawings of complete bipartite graphs on a plane

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C62: Graph representations (geometric and intersection representations, etc.)