Extremal density for sparse minors and subdivisions
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse minors. Among others, <br> (1+o(1))t2 average degree...
Main Authors: | Haslegrave, J, Kim, J, Liu, H |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Oxford University Press
2021
|
Similar Items
-
On the extremal number of subdivisions
by: Conlon, D, et al.
Published: (2019) -
Hitting minors, subdivisions, and immersions in tournaments
by: Jean-Florent Raymond
Published: (2018-01-01) -
The mechanization of multires algorithm and computation of mixed volume using mixed subdivision for sparse resultants
by: Aris, Nor'aini, et al.
Published: (2011) -
Variation of development standards and requirements for subdivisions of different densities
by: Kramer, Harold S
Published: (2012) -
Connectional subdivision of the claustrum: two visuotopic subdivisions in the macaque
by: Gattass, Ricardo, et al.
Published: (2014)