Xiangxiang Nie

collaborators

5 papers

math.CO2026

An improved upper bound for the planar Turán number of $C_{8}$

Xuqing Bai, Weichan Liu, Xiangxiang Nie +1

We prove that every $n$ -vertex simple planar graph with no copy of $C_{8}$ has at most \[ \frac{69}{25}(n-2) \] edges, for every $n \geq 8$ . This improves the best known bound \[ \frac…

math.CO2026

Upper bounds on the running time of bootstrap percolation

Weichan Liu, Xiangxiang Nie, Simón Piga +1

For $k$ -graphs $F$ and $H_{0}$ the $F$ -bootstrap percolation process (or $F$ -process) starting with $H_{0}$ is a sequence $(H_{i})_{i \geq 0}$ of $k$ -graphs such that $H_{i + 1}$ is obtained…

math.CO2026

Transversal tilings in k-partite graphs without large holes

Xinyu He, Xiangxiang Nie, Donglei Yang

We show that for any constant $μ > 0$ and $k \geq 3$ , there exists $α > 0$ such that the following holds for sufficiently large $n \in N$ . If $G = (V_{1}, \dots, V_{k}, E)$ is a spa…

math.CO2025

Covering graphs by isometric trees

Paul Bastide, Julien Duron, Jędrzej Hodor +2

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied.…

math.CO2025

Perfect tilings with the generalised triangle in $k$ -graphs

Weichan Liu, Xiangxiang Nie, Donglei Yang +1

Denote by $T_{k}$ the generalised triangle, a $k$ -uniform hypergraph on vertex set ${1, 2, \dots, 2 k - 1}$ with three edges ${1, \dots, k - 1, k}$ , ${1, \dots, k - 1, k + 1}$ and $\{k,k+1,\dots,…

An improved upper bound for the planar Turán number of C8​

Upper bounds on the running time of bootstrap percolation

Transversal tilings in k-partite graphs without large holes

Covering graphs by isometric trees

Perfect tilings with the generalised triangle in k-graphs

An improved upper bound for the planar Turán number of $C_{8}$

Perfect tilings with the generalised triangle in $k$ -graphs