论文标题
在线性平均度的图形中，高度连接的子图很大
Large highly connected subgraphs in graphs with linear average degree
论文作者
论文摘要
1972年，玛德证明，平均水平至少$ 4K $的每个图都有$（k+1）$连接的子图，并具有超过$ 2K $的顶点。我们通过表明可以用$ 3+\ frac {1} {3} $取代常数$ 4 $来改善这种约束。这个界限很锋利。
In 1972 Mader proved that every graph with average degree at least $4k$ has a $(k+1)$-connected subgraph with more than $2k$ vertices. We improve this bound by showing that the constant $4$ can be replaced by $3+\frac{1}{3}$; this bound is sharp.
