Large highly connected subgraphs in graphs with linear average degree
Combinatorics
2020-03-03 v1
Abstract
In 1972 Mader proved that every graph with average degree at least has a -connected subgraph with more than vertices. We improve this bound by showing that the constant can be replaced by ; this bound is sharp.
Cite
@article{arxiv.2003.00942,
title = {Large highly connected subgraphs in graphs with linear average degree},
author = {Johannes Carmesin},
journal= {arXiv preprint arXiv:2003.00942},
year = {2020}
}