Yong Lu

collaborators

6 papers

math.CO2026

Strict spectral supersaturation for cliques: extremal graphs and sharp thresholds

Qi Wu, Yong Lu

For every fixed $r \geq 3$ and all sufficiently large $n$ , we determine the largest adjacency spectral radius of an $n$ -vertex graph with fewer than $q c_{r} (n)$ copies of $K_{r + 1}$ , wh…

math.LO2026

A cardinal trichotomy for topological equivalence classes of countable trees

Qi Wu, Yong Lu

For a tree $T$ , let $[T]$ be the set of isomorphism classes of trees that are mutually topological minors of $T$ . Bruno and Szeptycki proved that every locally finite tree satisfie…

math.CO2026

Exact random covers of metric trees: balanced rounding, duality, and sharp thresholds

Qi Wu, Yong Lu

Norin and Turcotte's asymptotically sharp bound for graph burning [J. Combin. Theory Ser. B 168 (2024), 208--235] led them to an exact random-cover conjecture for finite metric tre…

math.CO2026

A Proof of the Chen--Raspaud Conjecture

Qi Wu, Yong Lu

For every integer $k \geq 2$ , Chen and Raspaud conjectured that each graph $G$ with odd girth $\og(G)\ge2k+1$ and maximum average degree $\mad(G)<2+1/k$ has a $(2 k + 1 : k)$ -coloring. In…

math.CO2026

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Jiaxu Zhong, Yong Lu

A graph $G$ is $k$ -factor-critical if $G - S$ has a perfect matching for every subset $S \subseteq V (G)$ with $∣ S ∣ = k$ . A spanning subgraph $H$ of $G$ is called a $[1, b]$ -odd factor i…

math.CO2025

Improved bounds on the $H$ -rank of a mixed graph in terms of the matching number and fractional matching number

Qi Wu, Yong Lu

A mixed graph $G$ is obtained by orienting some edges of a graph $G$ , where $G$ is the underlying graph of $G$ . Let $r (G)$ be the $H$ -rank of $\…

Strict spectral supersaturation for cliques: extremal graphs and sharp thresholds

A cardinal trichotomy for topological equivalence classes of countable trees

Exact random covers of metric trees: balanced rounding, duality, and sharp thresholds

A Proof of the Chen--Raspaud Conjecture

Some sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factors

Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Improved bounds on the $H$ -rank of a mixed graph in terms of the matching number and fractional matching number