3 papers
math.CO2025
The minimum degree of minimal 2-extendable claw-free graphs
Jing Guo, Fuliang Lu, Heping Zhang
A connected graph with a perfect matching is said to be -extendable for integers , , if any matching in of size is contained in a…
math.PR2023
Polynomial Mixing for a Weakly Damped Stochastic Nonlinear Schrödinger Equation
Jing Guo, Zhenxin Liu
This paper is devoted to proving the polynomial mixing for a weakly damped stochastic nonlinear Schrödinger equation with additive noise on a 1D bounded domain. The noise is white…
math.CO2022
Minimally k-factor-critical graphs for some large k
Jing Guo, Heping Zhang
A graph of order is said to be -factor-critical for integers , if the removal of any vertices results in a graph with a perfect matching. - and -f…