Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.10136

A Max-Min problem on spectral radius and connectedness of graphs

Zhenzhen Lou·Changxiang He
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the past decades, many scholars concerned which edge-extremal problems have spectral analogues? Recently, Wang, Kang and Xue showed an interesting result on $F$-free graphs [J. Combin. Theory Ser. B 159 (2023) 20--41]. In this paper, we study the above problem on critical graphs.Let $P$ be a property defined on a family $\mathbb{G}$ of graphs. A graph $G$ in $\mathbb{G}$ is said to be $P$-critical,if it has the property $P$ but $G-e$ no longer has for any edge $e\in E(G)$. Especially, a graph is minimally $k$-(edge)-connected,if it is $k$-connected (respectively, $k$-edge connected) and deleting an arbitrary edge always leaves a graph which is not $k$-connected (respectively, $k$-edge-connected). An interesting Max-Min problem asks what is the maximal spectral radius of an $n$-vertex minimally $k$-(edge)-connected graphs? In 2019, Chen and Guo [Discrete Math. 342 (2019) 2092--2099] gave the answer for $k=2$. In 2021, Fan, Goryainov and Lin [Discrete Appl. Math. 305 (2021) 154--163] determined the extremal spectral radius for minimally $3$-connected graphs. We obtain some structural properties of minimally $k$-(edge)-connected graphs. Furthermore, we solve the above Max-Min problem for $k\geq3$, which implies that every minimally $k$-(edge)-connected graph with maximal spectral radius also has maximal number of edges. Finally, a general problem is posed for further research.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhenzhen Lou, Changxiang He. 2025-03-13. A Max-Min problem on spectral radius and connectedness of graphs. https://arxiv.org/abs/2503.10136

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↗