Xinbu Cheng

activity

20222026

most citedSublinear hitting sets for some geometric graphs

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

collaborators

10 papers

math.CO2026

On the Turán number of blow-ups of $F_{5}$

Xiamiao Zhao, Xin Cheng, Dániel Gerbner +4

Let $F_{5}$ denote the $3$ -uniform hypergraph on the vertex set ${f_{1}, f_{2}, \dots, f_{5}}$ with hyperedges ${f_{1} f_{2} f_{3}, f_{1} f_{2} f_{4}, f_{3} f_{4} f_{5}}$ . Recently, Balogh, Clemen and Lu…

math.CO2026

Ramsey properties for tilings in random graphs

Lucas Aragão, Xinbu Cheng, Rafael Filipe +3

Let $m H$ be the graph formed by $m$ vertex-disjoint copies of a graph $H$ . Let $G \to (H)_{r}$ denote that, in any $r$ -colouring of the edges of $G$ , there exists a monochromatic cop…

math.CO2026

Triangle packings in randomly perturbed graphs

Xinbu Cheng, Hong Liu, Lanchao Wang +1

The longstanding Nash-Williams conjecture asserts that every $K_{3}$ -divisible graph $G$ with $δ (G) \geq 3 n /4$ admits a triangle decomposition. In the random setting, Frankl and Rödl s…

math.CO2026

Colour diversity in spanning structures under Dirac-type conditions

Xinbu Cheng, Xinqi Huang, Hong Liu +2

Finding spanning structures with many distinct colours in properly edge-coloured graphs is a central theme in extremal combinatorics. A classical result of Andersen shows that ever…

math.CO2025

Colour-biased Hamilton cycles in randomly perturbed graphs

Wenchong Chen, Xinbu Cheng, Zhifei Yan

Given a graph $G$ and an $r$ -edge-colouring $χ$ on $E (G)$ , a Hamilton cycle $H \subset G$ is said to have $t$ colour-bias if $H$ contains $n / r + t$ edges of the same colour in $χ$ . Fr…

math.CO2024

Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s, t}$

Xinbu Cheng, Zixiang Xu

A widely open conjecture proposed by Bollobás, Erdős, and Tuza in the early 1990s states that for any $n$ -vertex graph $G$ , if the independence number $α (G) = Ω (n)$ , then there is…

math.CO2024★ 1 cited

Sublinear hitting sets for some geometric graphs

Xinbu Cheng, Xinqi Huang, Mingyuan Rong +1

For an $n$ -vertex graph $G$ , let $h (G)$ denote the smallest size of a subset of $V (G)$ such that it intersects every maximum independent set of $G$ . A conjecture posed by Bollobás,…

math.CO2023★ 1 cited

Euclidean Gallai-Ramsey for various configurations

Xinbu Cheng, Zixiang Xu

The Euclidean Gallai-Ramsey problem, which investigates the existence of monochromatic or rainbow configurations in a colored $n$ -dimensional Euclidean space $E^{n}$ , was…

math.CO2023★ 1 cited

Exact values and improved bounds on $k$ -neighborly families of boxes

Xinbu Cheng, Meiqin Wang, Zixiang Xu +1

A finite family $F$ of $d$ -dimensional convex polytopes is called $k$ -neighborly if $d - k \leq dim (C \cap C^{'}) \leq d - 1$ for any two distinct members $C,C'\in\mathcal{F}…

math.CO2022

Local rainbow colorings for various graphs

Xinbu Cheng, Zixiang Xu

Motivated by a problem in theoretical computer science suggested by Wigderson, Alon and Ben-Eliezer studied the following extremal problem systematically one decade ago. Given a gr…

On the Turán number of blow-ups of F5​

Ramsey properties for tilings in random graphs

Triangle packings in randomly perturbed graphs

Colour diversity in spanning structures under Dirac-type conditions

Colour-biased Hamilton cycles in randomly perturbed graphs

Bollobás-Erdős-Tuza conjecture for graphs with no induced Ks,t​

Sublinear hitting sets for some geometric graphs

Euclidean Gallai-Ramsey for various configurations

Exact values and improved bounds on k-neighborly families of boxes

Local rainbow colorings for various graphs

On the Turán number of blow-ups of $F_{5}$

Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s, t}$

Exact values and improved bounds on $k$ -neighborly families of boxes