1 citations · 3 across the 6 of their papers we have counts for
6 papers · 1 filter
An extremal problem on potentially -graphic sequences
Chunhui Lai
A sequence is potentially graphical if it has a realization containing a as a subgraph. Let denote the smallest degree sum such…
An extremal problem on potentially -graphic sequences
Chunhui Lai
A sequence is potentially graphical if it has a realization containing a as a subgraph, where $K_{p_{1},p_{2},...,p_{t}}…
A note on potentially graphical sequences
Chunhui Lai
A sequence is potentially graphical if it has a realization containing a as a subgraph. Let denote the smallest degree sum such that every -ter…
Graphs without repeated cycle lengths
Chunhui Lai
In 1975, P. Erdös proposed the problem of determining the maximum number of edges in a graph of vertices in which any two cycles are of different lengths. In this paper,…
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
Chunhui Lai
In 1975, P. Erdös proposed the problem of determining the maximum number of edges in a graph of vertices in which any two cycles are of different lengths. In this paper,…
The smallest degree sum that yields potentially -graphical sequence
Chunhui Lai
In this paper we consider a variation of the classical Turán-type extremal problems. Let be an -term graphical sequence, and be the sum of the terms in . Let b…