3 papers
math.CO2026
The exact Turán number of the even wheel among non--partite graphs
Qixuan Yuan, Ruifang Liu, Sanming Zhou
Let denote the Turán number of . A graph is color-critical if there exists an edge such that . For a color-critical graph with $χ…
math.CO2025
Odd Hadwiger's conjecture for the complements of Kneser graphs
Meirun Chen, Reza Naserasr, Lujia Wang +1
A generalization of the four-color theorem, Hadwiger's conjecture is considered as one of the most important and challenging problems in graph theory, and odd Hadwiger's conjecture…
math.CO2016
Hadwiger's Conjecture for squares of 2-Trees
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's conjecture asserts that any graph contains a clique minor with order no less than the chromatic number of the graph. We prove that this well-known conjecture is true for…