Xing Peng

activity

20102026

most citedExtensions of Erdős-Gallai Theorem and Luo's Theorem with Applications

29 citations · 76 across the 24 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

A path Turan problem for infinite graphs

Xing Peng, Craig Timmons

Let $G$ be an infinite graph whose vertex set is the set of positive integers, and let $G_{n}$ be the subgraph of $G$ induced by the vertices ${1, 2, \dots, n}$ . An increasing pat…

math.CO2015

On the decomposition of random hypergraphs

Xing Peng

For an $r$ -uniform hypergraph $H$ , let $f (H)$ be the minimum number of complete $r$ -partite $r$ -uniform subhypergraphs of $H$ whose edge sets partition the edge set of $H$ . For a g…

math.CO2015★ 5 cited

Extremal problems on the Hamiltonicity of claw-free graphs

Binlong Li, Bo Ning, Xing Peng

In 1962, Erdős proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2…