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

24 papers

math.CO2026

Counting triangles in graphs with no wheels of order at least five

Chunyang Dou, Bo Ning, Xing Peng

For a family of graphs $F$ , a graph $G$ is said to be $F$ -free if it contains no member of $F$ as a subgraph. A wheel graph $W_{k}$ is a graph on $k + 1$ ver…

math.CO2023

Turán number of the odd-ballooning of complete bipartite graphs

Xing Peng, Mengjie Xia

Given a graph $L$ , the Turán number $ex (n, L)$ is the maximum possible number of edges in an $n$ -vertex $L$ -free graph. The study of Turán number of graphs is a central top…

math.CO2023

Anti-Ramsey number of matchings in $3$ -uniform hypergraphs

Mingyang Guo, Hongliang Lu, Xing Peng

Let $n, s,$ and $k$ be positive integers such that $k \geq 3$ , $s \geq 3$ and $n \geq k s$ . An $s$ -matching $M_{s}$ in a $k$ -uniform hypergraph is a set of $s$ pairwise disjoint edges. Th…

math.CO2021

The fractional chromatic number of $K_{Δ}$ -free graphs

Xiaolan Hu, Xing Peng

For a simple graph $G$ , let $χ_{f} (G)$ be the fractional chromatic number of $G$ . In this paper, we aim to establish upper bounds on $χ_{f} (G)$ for those graphs $G$ with restrictions o…

math.CO2019★ 1 cited

Large book--cycle Ramsey numbers

Qizhong Lin, Xing Peng

Let $B_{n}^{(k)}$ be the book graph which consists of $n$ copies of $K_{k + 1}$ all sharing a common $K_{k}$ , and let $C_{m}$ be a cycle of length $m$ . In this paper, we first determine th…

math.CO2018★ 29 cited

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

Bo Ning, Xing Peng

The famous Erdős-Gallai Theorem on the Turán number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2 m}{n}$ edges. In this not…

math.CO2017★ 11 cited

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

Yawen Li, Yao liu, Xing Peng

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characteri…

math.CO2016★ 1 cited

Extreme values of the stationary distribution of random walks on directed graphs

Sinan Aksoy, Fan Chung, Xing Peng

We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of…

math.CO2016★ 12 cited

The Randić index and signless Laplacian spectral radius of graphs

Bo Ning, Xing Peng

Given a connected graph $G$ , the Randić index $R (G)$ is the sum of $\frac{1}{d ( u ) d ( v )}$ over all edges ${u, v}$ of $G$ , where $d (u)$ and $d (v)$ are the degree of vertices…

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…

math.CO2014

On the chromatic number of the Erdős-Rényi orthogonal polarity graph

Xing Peng, Mike Tait, Craig Timmons

For a prime power $q$ , let $E R_{q}$ denote the Erdős-Rényi orthogonal polarity graph. We prove that if $q$ is an even power of an odd prime, then $χ( ER_{q}) \leq 2 \sqrt{q} + O ( \s…

math.CO2014★ 1 cited

High-order Phase Transition in Random Hypergrpahs

Linyuan Lu, Xing Peng

In this paper, we study the high-order phase transition in random $r$ -uniform hypergraphs. For a positive integer $n$ and a real $p \in [0, 1]$ , let $H := H^{r} (n, p)$ be the random $r$ -u…

math.CO2014★ 2 cited

Decomposition of random graphs into complete bipartite graphs

Fan Chung, Xing Peng

We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $τ (G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G…

math.CO2013

Bounds for generalized Sidon sets

Xing Peng, Rafael Tesoro, Craig Timmons

Let $Γ$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset Γ$ is a $C_{h} [g]$ -set if given any set $X \subset Γ$ with $∣ X ∣ = k$ , and any set $\{ k_1 , \dots , k_…

math.CO2013

Infinite Turán problems for bipartite graphs

Xing Peng, Craig Timmons

We consider an infinite version of the bipartite Turán problem. Let $G$ be an infinite graph with $V (G) = N$ and let $G_{n}$ be the $n$ -vertex subgraph of $G$ induced by the…

math.CO2013★ 5 cited

The Ramsey number of generalized loose paths in uniform Hypergrpahs

Xing Peng

Let $H = (V, E)$ be an $r$ -uniform hypergraph. For each $1 \leq s \leq r - 1$ , an $s$ -path $P_{n}^{r, s}$ of length $n$ in $H$ is a sequence of distinct vertices $v_1,v_2,\ldots…

math.CO2012★ 5 cited

Spectra of edge-independent random graphs

Linyuan Lu, Xing Peng

Let $G$ be a random graph on the vertex set ${1, 2, ..., n}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{…

math.CO2011★ 3 cited

Loose Laplacian spectra of random hypergraphs

Linyuan Lu, Xing Peng

Let $H = (V, E)$ be an $r$ -uniform hypergraph with the vertex set $V$ and the edge set $E$ . For $1 \leq s \leq r /2$ , we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s…

math.CO2011★ 1 cited

Monochromatic 4-term arithmetic progressions in 2-colorings of $Z_{n}$

Linyuan Lu, Xing Peng

This paper is motivated by a recent result of Wolf \cite{wolf} on the minimum number of monochromatic 4-term arithmetic progressions(4-APs, for short) in $Z_{p}$ , where $p$ is a pri…

math.CO2011

A Fractional Analogue of Brooks' Theorem

Andrew D. King, Linyuan Lu, Xing Peng

Let $Δ (G)$ be the maximum degree of a graph $G$ . Brooks' theorem states that the only connected graphs with chromatic number $χ (G) = Δ (G) + 1$ are complete graphs and odd cycles. We pr…

math.CO2011

High-ordered Random Walks and Generalized Laplacians on Hypergraphs

Linyuan Lu, Xing Peng

Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regula…

math.CO2010

The Fractional Chromatic Number of Triangle-free Graphs with $Δ \leq 3$

Linyuan Lu, Xing Peng

Let $G$ be any triangle-free graph with maximum degree $Δ \leq 3$ . Staton proved that the independence number of $G$ is at least 5/14n. Heckman and Thomas conjectured that Staton's…

Counting triangles in graphs with no wheels of order at least five

Turán number of the odd-ballooning of complete bipartite graphs

Anti-Ramsey number of matchings in 3-uniform hypergraphs

The fractional chromatic number of KΔ​-free graphs

Large book--cycle Ramsey numbers

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

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

Extreme values of the stationary distribution of random walks on directed graphs

The Randić index and signless Laplacian spectral radius of graphs

A path Turan problem for infinite graphs

On the decomposition of random hypergraphs

Extremal problems on the Hamiltonicity of claw-free graphs

On the chromatic number of the Erdős-Rényi orthogonal polarity graph

High-order Phase Transition in Random Hypergrpahs

Decomposition of random graphs into complete bipartite graphs

Bounds for generalized Sidon sets

Infinite Turán problems for bipartite graphs

The Ramsey number of generalized loose paths in uniform Hypergrpahs

Spectra of edge-independent random graphs

Loose Laplacian spectra of random hypergraphs

Monochromatic 4-term arithmetic progressions in 2-colorings of Zn​

A Fractional Analogue of Brooks' Theorem

High-ordered Random Walks and Generalized Laplacians on Hypergraphs

The Fractional Chromatic Number of Triangle-free Graphs with Δ≤3

Anti-Ramsey number of matchings in $3$ -uniform hypergraphs

The fractional chromatic number of $K_{Δ}$ -free graphs

Monochromatic 4-term arithmetic progressions in 2-colorings of $Z_{n}$

The Fractional Chromatic Number of Triangle-free Graphs with $Δ \leq 3$