Chunhui Lai

most citedAn extremal problem on potentially

K_{p_{1}, p_{2}, ..., p_{t}}

-graphic sequences

1 citations · 1 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2004

An extremal problem on potentially $K_{m} - P_{k}$ -graphic sequences

Chunhui Lai

A sequence $S$ is potentially $K_{m} - P_{k}$ graphical if it has a realization containing a $K_{m} - P_{k}$ as a subgraph. Let $σ (K_{m} - P_{k}, n)$ denote the smallest degree sum such…

math.CO2004★ 1 cited

An extremal problem on potentially $K_{p_{1}, p_{2}, ..., p_{t}}$ -graphic sequences

Chunhui Lai

A sequence $S$ is potentially $K_{p_{1}, p_{2}, ..., p_{t}}$ graphical if it has a realization containing a $K_{p_{1}, p_{2}, ..., p_{t}}$ as a subgraph, where $K_{p_{1},p_{2},...,p_{t}}…

math.CO2003★ 1 cited

A note on potentially $K_{4} - e$ graphical sequences

Chunhui Lai

A sequence $S$ is potentially $K_{4} - e$ graphical if it has a realization containing a $K_{4} - e$ as a subgraph. Let $σ (K_{4} - e, n)$ denote the smallest degree sum such that every $n$ -ter…

math.CO2003★ 1 cited

Graphs without repeated cycle lengths

Chunhui Lai

In 1975, P. Erdös proposed the problem of determining the maximum number $f (n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper,…

An extremal problem on potentially Km​−Pk​-graphic sequences

An extremal problem on potentially Kp1​,p2​,...,pt​​-graphic sequences

A note on potentially K4​−e graphical sequences

Graphs without repeated cycle lengths

An extremal problem on potentially $K_{m} - P_{k}$ -graphic sequences

An extremal problem on potentially $K_{p_{1}, p_{2}, ..., p_{t}}$ -graphic sequences

A note on potentially $K_{4} - e$ graphical sequences