Dense Induced Subgraphs of Dense Bipartite Graphs
From MaRDI portal
Publication:4986805
DOI10.1137/20M1370744zbMath1462.05258arXiv2004.00035OpenAlexW3142734242MaRDI QIDQ4986805
Publication date: 28 April 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.00035
Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items (1)
Cites Work
- Unnamed Item
- A note on Thomassen's conjecture
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- On finite set-systems whose every intersection is a kernel of a star
- Girth in graphs
- Induced subdivisions and bounded expansion
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
- Dense graphs without 3-regular subgraphs
- Dense induced bipartite subgraphs in triangle-free graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- A survey of χ‐boundedness
- On a conjecture of Thomassen concerning subgraphs of large girth
- Separation Choosability and Dense Bipartite Induced Subgraphs
- On a problem of K. Zarankiewicz
This page was built for publication: Dense Induced Subgraphs of Dense Bipartite Graphs
