Skip to content
Preprint

Removable matchings in $2$-connected graphs

Sep 2026 · 0 citations · 18 references
Mathematics

Abstract

A matching $M$ of a $2$-connected graph $G$ is \emph{removable} if $G-M$ is $2$-connected. We prove that, for every integer $d\ge4$, every $2$-connected graph with at least $2d$ vertices and minimum degree at least $d$ has a removable matching of size $d$. This improves the previously known lower bound $d-2$ for $d\ge5$ to the optimal value $d$, answering a question of Li, Zhou, Fujita, and Mao. We also show that a $2$-connected graph on at least six vertices with minimum degree at least $3$ has a removable matching of size $3$ if and only if it is not a wheel. Our proofs use edge contraction and the structure of \emph{minimal non-removable matchings}.

View source

Similar papers

Preprint Oct 2026

Structural aspects of $1$-limited domination in cubic graphs

A set $D\subseteq V(G)$ is a $1$-limited dominating set of a graph $G$ if every vertex outside $D$ has a neighbor in $D$ and every vertex of $D$ has at most one neighbor outside $D$. The minimum cardinality among all $1$-limited dominating sets of $G$ is denoted by $\gamma_1^{\mathrm L}(G)$. For every cubic graph $G$ o...

Goran Radić, Gordana Radić, Aleksandra Tepeh · 0 citations
Preprint Oct 2026

Clique counts under degree and matching constraints

We study the maximum number of $t$-cliques in graphs with maximum degree at most $D$ and matching number at most $M$, with no restriction on the number of vertices. For $t\ge 3$, we determine this maximum whenever $D\ge 2M-1$ and characterize all extremal graphs when the maximum is positive. Up to isolated vertices, th...

Rajat Adak · 0 citations
Preprint Oct 2026

The domination number of the 2-token graph of the complete bipartite graph

For a graph $G$, the $2$-token graph $F_2(G)$ has as vertices all $2$-subsets of $V(G)$, with two such subsets adjacent whenever their symmetric difference is an edge of $G$. In this paper, we determine the domination number of the $2$-token graph of the complete bipartite graph $K_{m,n}$, for all integers $2\le m\le n...

E. Troncoso, I. Caldera, L. M. Rivera · 0 citations
Preprint Nov 2026

The real eigenvalues of the non-backtracking Laplacian

Let $G$ be a simple graph on $N$ nodes and $M$ edges, with minimum degree at least $2$. We prove that the non-backtracking Laplacian of $G$ has at least $2M-2N+2c+2b$ real eigenvalues, counted with algebraic multiplicity, where $c$ is the number of connected components of $G$ and $b$ is the number of bipartite ones. Mo...

R. Mulas, Leo Torres · 0 citations
Preprint Sep 2026

A sharp density bound for 5-connected graphs with no $\Ke$ minor

Let $\Ke$ be obtained from $K_7$ by deleting two independent edges. We prove that every 5-connected graph on $n\ge7$ vertices with at least $4n-9$ edges contains a $\Ke$ minor, settling Conjecture~1.4 of Dvo\v r\'ak, Norin and Rahman (arXiv preprint 2609.17760v1). The bound is sharp. We prove the stronger statement tha...

Cai-Bing Chang, Zi-Jian Deng, Qin-Fei Tang et al. · 0 citations
Preprint Oct 2026

On the fault-tolerant metric dimension of maximal outerplanar graphs

Given a graph $G$, a set $W$ of vertices of $G$ is a resolving set if, for any pair of vertices $z_1$ and $z_2$ of $G$, there is a vertex $w\in W$ such that $d(w,z_1)\ne d(w,z_2)$, where $d(u,v)$ denotes the length of a shortest path between the vertices $u$ and $v$. The metric dimension of a graph $G$, $\beta(G)$, is...

C. Hernando, M. Maureso, M. Mora et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.