Affiliation:
1. Laboratoire G‐SCOP CNRS, Univ. Grenoble Alpes Grenoble France
2. Département d'Informatique Université libre de Bruxelles Brussels Belgium
3. School of Computer Science Carleton University Ottawa Canada
Abstract
AbstractWe show that for every integer , there exists a graph with vertices and edges such that every ‐vertex planar graph is isomorphic to a subgraph of . The best previous bound on the number of edges was , proved by Babai, Chung, Erdős, Graham, and Spencer in 1982. We then show that for every integer , there is a graph with vertices and edges that contains induced copies of every ‐vertex planar graph. This significantly reduces the number of edges in a recent construction of the authors with Dujmović, Gavoille, and Micek.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shallow Minors, Graph Products, and Beyond-Planar Graphs;SIAM Journal on Discrete Mathematics;2024-03-13
2. Product structure of graph classes with bounded treewidth;Combinatorics, Probability and Computing;2023-12-07
3. Proof of the Clustered Hadwiger Conjecture;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06