Topological minors in bipartite graphs
From MaRDI portal
Publication:644636
DOI10.1007/s10114-011-0149-xzbMath1225.05224OpenAlexW2047042878MaRDI QIDQ644636
Martín Cera, Pedro García-Vázquez, Camino Balbuena, J. Carlos Valenzuela-Tripodoro
Publication date: 4 November 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-011-0149-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smallest close to regular bipartite graphs without an almost perfect matching
- The existence of even regular factors of regular graphs on the number of cut edges
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- New exact values of the maximum size of graphs free of topological complete subgraphs
- \(k\) -factors in regular graphs
- Graphs isomorphic to their maximum matching graphs
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Threshold functions for the bipartite Turán property
- Topological minors in graphs of large girth
- The extremal function for unbalanced bipartite minors
- Bipartite Ramsey numbers and Zarankiewicz numbers
- On the half-half case of the Zarankiewicz problem
- New asymptotics for bipartite Turán numbers
- On 2-factors with prescribed properties in a bipartite graph
- Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
- New results on the Zarankiewicz problem
- Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
- On triangle-free random graphs
- Improved Bounds for Topological Cliques in Graphs of Large Girth
- Contributions to the problem of Zrankiewicz
This page was built for publication: Topological minors in bipartite graphs
