Qinglin Wang

collaborators

2 papers

math.CO2026

Extremal graphs with no subgraph admitting $k + 1$ edge-disjoint spanning trees

Qinglin Wang, Yingzhi Tian

A graph $G$ is $I ¨ _{k}$ -maximal if $G$ contains no subgraph admitting $k + 1$ edge-disjoint spanning trees, while the addition of any edge in the complement of $G$ yields a subgraph th…

math.CO2026

Extremal Problems for the Family of $k$ -Strongly Connected Digraphs

Qinglin Wang, Yingzhi Tian

Let $D$ be a family of digraphs. A digraph $D$ is \emph{ $D$ -saturated} if it contains no member of $D$ as a subdigraph, but for any arc $e$ in the com…

Extremal graphs with no subgraph admitting k+1 edge-disjoint spanning trees

Extremal Problems for the Family of k-Strongly Connected Digraphs

Extremal graphs with no subgraph admitting $k + 1$ edge-disjoint spanning trees

Extremal Problems for the Family of $k$ -Strongly Connected Digraphs