no code implementations • 3 Dec 2020 • John Haslegrave, JaeHoon Kim, Hong Liu
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition.
Combinatorics 05C83, 05C35
