A Note Related to Graph Theory
arXiv:2309.05199
Abstract
This article foucuses on -free graph. In this paper, we prove that if G is -free, then . We then use our result to obtain the upper bound of order and chromatic number of -free graph .
12 pages,8 figures