Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.07997

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs

Maximilian Krone
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mader conjectured in 1979 that an average degree of at least $3k-1$ in a graph is sufficient for the existence of a $(k+1)$-connected subgraph. The following minimum degree analogue holds: Every graph with minimum degree at least $3k-1$ contains a $(k+1)$-connected subgraph on more than $2k$ vertices. Moreover, for triangle-free graphs, already an average degree of at least $2k$ is sufficient for a $(k+1)$-connected subgraph, which has at least $2(k+1)$ vertices. For edge-connectivity (in simple graphs), we prove the following: Every graph with average degree at least $2k$ contains a $(k+1)$-edge-connected subgraph on more than $2k$ vertices. Moreover, for every small $α>0$ and for $k$ large enough in terms of $α$, already a minimum degree of at least $k+k^{\frac{1}{2}+α} = \big(1+o(1)\big)k$ is sufficient for a $(k+1)$-edge-connected subgraph. It is shown that all of these results are sharp in some sense. The results are applied to decompose graphs into two highly connected or edge-connected parts.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maximilian Krone. 2026-08-13. Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs. https://arxiv.org/abs/2508.07997

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗