Topological minors in bipartite graphs
From MaRDI portal
Publication:644636
DOI10.1007/S10114-011-0149-XzbMATH Open1225.05224OpenAlexW2047042878MaRDI QIDQ644636FDOQ644636
Authors: Martín Cera, P. García-Vázquez, C. 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
Recommendations
- Extremal connectivity for topological cliques in bipartite graphs
- Turán number of bipartite graphs with no \(K_{t,t}\)
- The extremal number of the subdivisions of the complete bipartite graph
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- Bipartite subgraphs of \(H\)-free graphs
Cites Work
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- The extremal function for unbalanced bipartite minors
- Title not available (Why is that?)
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- New asymptotics for bipartite Turán numbers
- Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
- Title not available (Why is that?)
- On 2-factors with prescribed properties in a bipartite graph
- On triangle-free random graphs
- \(k\) -factors in regular graphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Improved Bounds for Topological Cliques in Graphs of Large Girth
- Graphs isomorphic to their maximum matching graphs
- Bipartite Ramsey numbers and Zarankiewicz numbers
- Title not available (Why is that?)
- 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
- Threshold functions for the bipartite Turán property
- Topological minors in graphs of large girth
- On the half-half case of the Zarankiewicz problem
- Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
- New results on the Zarankiewicz problem
- Contributions to the problem of Zrankiewicz
- New exact values of the maximum size of graphs free of topological complete subgraphs
Cited In (7)
This page was built for publication: Topological minors in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644636)