Claw-decomposition of Kneser Graphs
نویسندگان
1 Department of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India
2 Department of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India
3 Department of Mathematics, A. V. V. M. Sri Pushpam College( Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India
doi
10.22108/toc.2021.126283.1792چکیده
A claw is a star with three edges. The Kneser graph $KG_{n,2}$ is the graph whose vertices are the $2$-subsets of an $n$-set, in which two vertices are adjacent if and only if their intersection is empty. In this paper, we prove that $KG_{n,2}$ is claw-decomposable, for all $n \geq 6$.
