# Dense Induced Subgraphs of Dense Bipartite Graphs

@article{McCarty2021DenseIS,
title={Dense Induced Subgraphs of Dense Bipartite Graphs},
author={Rose McCarty},
journal={SIAM J. Discret. Math.},
year={2021},
volume={35},
pages={661-667}
}
• Rose McCarty
• Published 31 March 2020
• Mathematics
• SIAM J. Discret. Math.
We prove that every bipartite graph of sufficiently large average degree has either a $K_{t,t}$-subgraph or an induced subgraph of average degree at least $t$ and girth at least $6$. We conjecture that "$6$" can be replaced by "$k$", which strengthens a conjecture of Thomassen. In support of this conjecture, we show that it holds for regular graphs.
1 Citations
C4-free subgraphs with large average degree
• Mathematics
Israel Journal of Mathematics
• 2021
Motivated by a longstanding conjecture of Thomassen, we study how large the average degree of a graph needs to be to imply that it contains a $C_4$-free subgraph with average degree at least $t$.

## References

SHOWING 1-10 OF 18 REFERENCES
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs
• Mathematics
Comb.
• 2020
It is proved that any H -free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degreeAt least c H log d /log log d , thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé.
Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree
• Mathematics
Comb.
• 2004
We prove that for every k there exists d=d(k) such that every graph of average degree at least d contains a subgraph of average degree at least k and girth at least six. This settles a special case
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
• Mathematics
WG
• 2000
We proof that every graph of clique-width k which does not contain the complete bipartite graph Kn,n for some n > 1 as a subgraph has tree-width at most 3k(n - 1) - 1. This immediately implies that a
On a conjecture of Thomassen concerning subgraphs of large girth
• Mathematics
J. Graph Theory
• 2011
This work gives another proof for the case g = 6 which is based on a result of Furedi about hypergraphs and shows that the analogous conjecture for directed graphs is true.
Dense Graphs without 3-Regular Subgraphs
• Mathematics
J. Comb. Theory, Ser. B
• 1995
This paper shows the existence of graphs with cn log log n edges that contain no 3-regular subgraphs and shows that graph with c k n log Δ ( G ) edges contain k -regular sub graphs.
Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree
• Mathematics
Comb.
• 2004
We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a Ks,s as a subgraph or an induced subdivision of H.
A survey of $\chi$-boundedness
• Mathematics
• 2018
If a graph has bounded clique number, and sufficiently large chromatic number, what can we say about its induced subgraphs? Andras Gyarfas made a number of challenging conjectures about this in the
Separation Choosability and Dense Bipartite Induced Subgraphs
• Mathematics
Combinatorics, Probability and Computing
• 2019
It is shown for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree, and strengthens results of Molloy and Thron and, partially, of Alon.
A survey of χ ‐boundedness
• Mathematics
J. Graph Theory
• 2020
If a graph has bounded clique number and sufficiently large chromatic number, what can we say about its induced subgraphs? András Gyárfás made a number of challenging conjectures about this in the
Girth in graphs