Qiang Zhou

collaborators

2 papers

math.CO2024

Piercing independent sets in graphs without large induced matching

Jiangdong Ai, Hong Liu, Zixiang Xu +1

Given a graph $G$ , denote by $h (G)$ the smallest size of a subset of $V (G)$ which intersects every maximum independent set of $G$ . We prove that any graph $G$ without induced match…

math.CO2023

Hadwiger's Conjecture for some graphs with independence number two

Tong Li, Qiang Zhou

Let $h (G)$ denote the largest $t$ such that $G$ contains $K_{t}$ as a minor and $χ (G)$ be the chromatic number of $G$ respectively. In 1943, Hadwiger conjectured that $h(G) \geq χ(G)…