Xiang-Yu Li

collaborators

3 papers

math.CO2026

Upper bounds for ordered Ramsey numbers of forests and bounded-degree graphs

Lior Gishboliner, Xiangyu Li

We prove the following two upper bounds for ordered Ramsey numbers: (1) Every ordered forest $F$ on $n$ vertices satisfies $R_{<} (F, F) = O (n^{1 + ⌈ l o g χ_{<} (F)⌉})$ . This in p…

math.CO2026

Multicolor Ramsey numbers of ordered matchings

Xiangyu Li

For an ordered graph $H$ and an integer $q \geq 2$ , let $r_{<} (H; q)$ denote the $q$ -color ordered Ramsey number of $H$ . Conlon, Fox, Lee and Sudakov asked whether, for every $q \ge…

math.CO2026

Multicolor $K_{r}$ -Tilings with High Discrepancy

Henry Chan, Daniel Cheng, Lior Gishboliner +1

We study the minimum degree threshold $δ_{r, q}$ guaranteeing the existence of $K_{r}$ -tilings of high discrepancy in any $q$ -edge-coloring. Balogh, Csaba, Pluhár and Treglown handled…

Upper bounds for ordered Ramsey numbers of forests and bounded-degree graphs

Multicolor Ramsey numbers of ordered matchings

Multicolor Kr​-Tilings with High Discrepancy

Multicolor $K_{r}$ -Tilings with High Discrepancy