A note on dense bipartite induced subgraphs

Stefan Glock

A note on dense bipartite induced subgraphs

Combinatorics 2020-06-11 v1

Authors: Stefan Glock

Abstract

This exposition contains a short and streamlined proof of the recent result of Kwan, Letzter, Sudakov and Tran that every triangle-free graph with minimum degree $d$ contains an induced bipartite subgraph with average degree $\Omega(\ln d/\ln\ln d)$ .

Keywords

bipartite graphs graph theory

Cite

@article{arxiv.2006.05101,
  title  = {A note on dense bipartite induced subgraphs},
  author = {Stefan Glock},
  journal= {arXiv preprint arXiv:2006.05101},
  year   = {2020}
}

Comments

3 pages

Related papers

View all related →