论文标题
关于密集的两分诱导子图的注释
A note on dense bipartite induced subgraphs
论文作者
论文摘要
该博览会包含一个简短的简化证明，证明了Kwan，Letzter，Sudakov和Tran的最新结果，即每个带有最低度$ d $的三角形图都包含一个诱导的两部分子图，其平均度$ω（\ ln d/\ ln d/\ ln \ ln \ ln dn d）$。
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 $Ω(\ln d/\ln\ln d)$.
