Showing 2025Show all
2 papers · 1 filter
math.CO2025
Odd and even cycle lengths, minimum degree and chromatic number in graphs
Xiaolin Wang, Meiduo Chen, Xueping Xu
We present the relations between clique number and chromatic number with given the number of odd or even or all cycle lengths. Let be the set of odd cycle lengths of a…
math.CO2025
Turán problems for suspension of a balanced tree
Xiutao Zhu, Xiaolin Wang, Yanbo Zhang +1
The Turán number $\ex(n,H)$ is the maximum number of edges that an -vertex -free graph can have. The suspension is obtained from by adding a new vertex whic…