论文标题
致密的密集两分图的亚图
Dense induced subgraphs of dense bipartite graphs
论文作者
论文摘要
我们证明，每个两分的平均水平图都具有$ k_ {t，t} $ - 子图或平均程度的诱发子图，至少$ t $和腰围至少至少$ 6 $。我们猜想“ $ 6 $”可以用“ $ k $”代替，这加强了托马森的猜想。为了支持这种猜想，我们证明它适用于常规图。
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.
