Weichan Liu

collaborators

7 papers

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

Infinitely many accumulation points of codegree TurÃ¡n densities

Heng Li, Weichan Liu, Bjarne SchÃ¼lke +1

The codegree TurÃ¡n density $I^^{3} (F)$ of a $k$ -graph $F$ is the smallest $I^^{3} \in [0, 1)$ such that every $k$ -graph $H$ with $I^´_{k - 1} (H) \geq (I^^{3} + o (1)) ∣ V (H) ∣$ contains a copy of…

math.CO2025

Equitable coloring of sparse graphs

Weichan Liu, Xin Zhang

An equitable coloring of a graph is a proper coloring where the sizes of any two distinct color classes differ by at most one. The celebrated Chen-Lih-Wu Conjecture (CLWC for short…

math.CO2025

Local rainbow colorings of hypergraphs

Zhenyu Li, Weichan Liu, Guowei Sun +2

In this paper, we generalize the concepts related to rainbow coloring to hypergraphs. Specifically, an $(n, r, H)$ -local coloring is defined as a collection of $n$ edge-colorings, $f…

math.CO2025

Equitable coloring of graphs beyond planarity

Weichan Liu

An equitable coloring of a graph is a proper coloring where the sizes of any two different color classes do not differ by more than one. A graph is IC-planar if it can be drawn in…

math.CO2025

Odd coloring of 2-boundary planar graphs and beyond

Weichan Liu, Mengke Qi, Xin Zhang

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at…