Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.05247

l-connectivity, l-edge-connectivity and spectral radius of graphs

Dandan Fan·Xiaofeng Gu·Huiqiu Lin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S. Confirming a conjecture of Brouwer, Gu [SIAM J. Discrete Math. 35 (2021) 948--952] proved a tight lower bound on toughness of regular graphs in terms of the second largest absolute eigenvalue. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] then studied the toughness of simple graphs from the spectral radius perspective. While the toughness is an important concept in graph theory, it is also very interesting to study |S| for which c(G-S)\geq l for a given integer l\geq 2. This leads to the concept of the l-connectivity, which is defined to be the minimum number of vertices of G whose removal produces a disconnected graph with at least l components or a graph with fewer than l vertices. Gu [European J. Combin. 92 (2021) 103255] discovered a lower bound on the l-connectivity of regular graphs via the second largest absolute eigenvalue. As a counterpart, we discover the connection between the l-connectivity of simple graphs and the spectral radius. We also study similar problems for digraphs and an edge version.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dandan Fan, Xiaofeng Gu, Huiqiu Lin. 2023-09-11. l-connectivity, l-edge-connectivity and spectral radius of graphs. https://arxiv.org/abs/2309.05247

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↗