Yusheng Li

activity

20142021

most citedRedundant edges in Ramsey graphs

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

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2021

Ramsey numbers of graphs with most degrees bounded in random graphs

Ye Wang, Yusheng Li

For graphs $F$ and $G$ , let $F \to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$ . Denote by $G (N, p)$ the random graph space of order $N$ and…

math.CO2019

Degree bipartite Ramsey numbers

Ye Wang, Yusheng Li, Yan Li

Let $H s G$ denote that any edge-coloring of $H$ by $s$ colors contains a monochromatic $G$ . The degree Ramsey number $r_{Δ} (G; s)$ is defined to be $\min\{Δ(H):H\xrighta…

math.CO2018

Cycle Ramsey numbers for random graphs

Meng Liu, Yusheng Li, Qizhong Lin +1

Let $C_{n}$ be a cycle of length $n$ . As an application of Szemerédi's regularity lemma, Łuczak ( $R (C_{n}, C_{n}, C_{n}) \leq (4 + o (1)) n$ , J. Combin. Theory Ser. B, 75 (1999), 174--187) in f…

math.CO2017★ 1 cited

Redundant edges in Ramsey graphs

Ye Wang, Yusheng Li, Yan Li

For graphs $G$ , $F$ and $H$ , let $G \to (F, H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$ . The Ramsey number $R(F,H)=\min\{r|\; K…

math.CO2014

Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees

Qizhong Lin, Yusheng Li

For graphs $G$ and $H$ , let $G \to (H, H)$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ as a subgraph, and $H (Δ, n) = {H : ∣ V (H) ∣ = n, Δ (H) \leq Δ}$ .…

math.CO2014

A Folkman Linear Family

Qizhong Lin, Yusheng Li

For graphs $F$ and $G$ , let $F \to (G, G)$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$ . Define Folkman number $f (G; p)$ to be the smallest order of a g…

math.CO2014

Ramsey numbers of paths and graphs of the same order

Chaoping Pei, Yusheng Li

For graphs $F_{n}$ and $G_{n}$ of order $n$ , if $R (F_{n}, G_{n}) = (χ (G_{n}) - 1) (n - 1) + σ (G_{n})$ , then $F_{n}$ is said to be $G_{n}$ -good, where $σ (G_{n})$ is the minimum size of a color class among all…