Forcing unbalanced complete bipartite minors
From MaRDI portal
Publication:703605
DOI10.1016/J.EJC.2004.02.002zbMATH Open1061.05087OpenAlexW1979717362MaRDI QIDQ703605FDOQ703605
Authors: Daniela Kühn, Deryk Osthus 
Publication date: 11 January 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.02.002
Recommendations
- The extremal function for unbalanced bipartite minors
- Unbalanced bipartite factorizations of complete bipartite graphs
- Bounds on the forcing numbers of bipartite graphs
- On minimum balanced bipartitions of triangle-free graphs
- Disjoint complete minors and bipartite minors
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
- Linear connectivity forces large complete bipartite minors
- Forcing large complete (topological) minors in infinite graphs
- scientific article; zbMATH DE number 1303530
- On the forced matching numbers of bipartite graphs
Cites Work
- Hadwiger's conjecture is true for almost every graph
- The extremal function for unbalanced bipartite minors
- The extremal function for complete minors
- The extremal function for noncomplete minors
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- An extremal function for contractions of graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- On \(K_{s,t}\)-minors in graphs with given average degree
- An improved linear edge bound for graph linkages
- Highly linked graphs
- Title not available (Why is that?)
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
Cited In (28)
- The extremal function for disconnected minors
- Average degree conditions forcing a minor
- Forcing a sparse minor
- Bipartite graphs with no \(K_6\) minor
- Product structure of graph classes with bounded treewidth
- Dense graphs have \(K_{3,t}\) minors
- On \(K_{s,t}\)-minors in graphs with given average degree
- Linear connectivity forces large complete bipartite minors
- Complete minors in \(K_{s,s}\)-free graphs
- The extremal function for unbalanced bipartite minors
- A note on the saturation number of the family of \(k\)-connected graphs
- Extremal functions for sparse minors
- Rooted minor problems in highly connected graphs
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- Small minors in dense graphs
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
- Some recent progress and applications in graph minor theory
- The extremal function for Petersen minors
- Complete minors and average degree: A short proof
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- List-coloring graphs without \(K_{4,k}\)-minors
- Recent progress towards Hadwiger's conjecture
- Hadwiger's conjecture
- A lower bound on the average degree forcing a minor
- Cycles of Given Size in a Dense Graph
- Asymptotic density of graphs excluding disconnected minors
- Disjoint complete minors and bipartite minors
- Disjoint unions of complete minors
This page was built for publication: Forcing unbalanced complete bipartite minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703605)
