Xin-Heng Lin

most citedBorodin-Kostochka Conjecture holds for odd-hole-free graphs

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

collaborators

3 papers

math.CO2026

Coloring Small $K_{t}$ -Minor-Free Graphs

Xinheng Lin

Delcourt and Postle proved that every $K_{t}$ -minor-free graph is $O (t lo g lo g t)$ -colorable and reduced the Linear Hadwiger Conjecture to coloring $K_{t}$ -minor-free graphs on $O(t\lo…

math.CO2026

An Asymptotically Tight $t lo g t$ Bound for $k$ -Connected Subgraphs in Dense $K_{t}$ -Minor-Free Graphs

Xinheng Lin

Delcourt and Postle reduced the Linear Hadwiger Conjecture to coloring $K_{t}$ -minor-free graphs on $O (t lo g^{4} t)$ vertices. An important theorem in their proof process asserts that…

math.CO2023★ 1 cited

Borodin-Kostochka Conjecture holds for odd-hole-free graphs

Rong Chen, Kaiyang Lan, Xinheng Lin +1

The Borodin-Kostochka Conjecture states that for a graph $G$ , if $Δ (G) \geq 9$ , then $χ (G) \leq max {Δ (G) - 1, ω (G)}$ . In this paper, we prove the Borodin-Kostochka Conjecture holding…

Coloring Small Kt​-Minor-Free Graphs

An Asymptotically Tight tlogt Bound for k-Connected Subgraphs in Dense Kt​-Minor-Free Graphs

Borodin-Kostochka Conjecture holds for odd-hole-free graphs

Coloring Small $K_{t}$ -Minor-Free Graphs

An Asymptotically Tight $t lo g t$ Bound for $k$ -Connected Subgraphs in Dense $K_{t}$ -Minor-Free Graphs