Weichan Liu

activity

20172026

most citedOdd coloring of 2-boundary planar graphs and beyond

2 citations · 3 across the 14 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

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

Bootstrap percolation of extension hypergraphs

Weichan Liu, Bjarne Schülke, Xin Zhang

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

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…

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

Bootstrap percolation of extension hypergraphs

Upper bounds on the running time of bootstrap percolation

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