Feng-Ming Dong

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

A Turán-type extremal problem for the number of spanning trees in $C_{4}$ -free graphs

Shaohan Xu, Fengming Dong, Kexiang Xu

For a graph $F$, the Turán number $\ex(n,F)$ is the maximum number of edges in an $F$-free graph on $n$ vertices. Let $q\ge 2$ be an integer and set $n=q^{2}+q+1$. Brow…

math.CO2014

From G-parking functions to B-parking functions

Fengming Dong

A matching $M$ in a multigraph $G = (V, E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V (M)$ (i.e., the set of vertices s…

A Turán-type extremal problem for the number of spanning trees in C4​-free graphs

From G-parking functions to B-parking functions

A Turán-type extremal problem for the number of spanning trees in $C_{4}$ -free graphs