Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.27173

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical

Jiaxu Zhong·Yong Lu
View original source ↗Read source document ↗Export metadata ↓

Abstract

A graph $G$ is called $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019] posed an adjacency spectral condition for a graph with minimum degree to be $k$-factor-critical. A graph $G$ is fractional $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a fractional perfect matching. Clearly, the fractional $k$-factor-criticality of a graph is a necessary property for a graph to be $k$-factor-critical. Jia, Fan and Liu [Discrete Appl. Math. 386 (2026) 255-263] proposed a tight sufficient condition in terms of the spectral radius for a graph with fractional $k$-factor-criticality to be $k$-factor-critical. A natural question arises: can we derive analogous sufficient conditions by incorporating the minimum degree parameter of graphs? We first establish a lower bound on the size to ensure that a $(k+1)$-connected graph with fractional $k$-factor-criticality is $k$-factor-critical, where $k$ is a positive integer with $k\geq1$. Moreover, we provide a sufficient condition in terms of the spectral radius for a $(k+1)$-connected graph with fractional $k$-factor-criticality to be $k$-factor-critical. Our results generalize the result of Jia, Fan and Liu to $(k+1)$-connected graphs. Furthermore, our spectral conditions apply to a broader family of connected graphs compared with the results of Fan and Lin, as well as Jia et al.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaxu Zhong, Yong Lu. 2026-05-26. Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical. https://arxiv.org/abs/2605.27173

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗