Let be a real number such that 0< < 1 2 and t a positive integer. Let n be a sufficiently large positive integer as a function of t and . We show that every n-vertex graph with at least n 1+ edges contains a subdivision of K t in which each edge of K t is subdivided less than 10 / times. This refine
Topological minors in bipartite graphs
✍ Scribed by Camino Balbuena; Martín Cera; Pedro García-Vázquez; Juan Carlos Valenzuela
- Book ID
- 106279736
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2011
- Tongue
- English
- Weight
- 263 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K rþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! o os that every graph of chromatic number at least r contains a subdivision of K r (which is fal
Let H be a fixed graph. We show that any H-minor free graph G of high enough girth has circular chromatic number arbitrarily close to two. Equivalently, each such graph G admits a homomorphism to a large odd circuit. In particular, graphs of high girth and of bounded genus, or of bounded tree width,