University of IsfahanTransactions on Combinatorics2251-865711120220301Claw-decomposition of Kneser Graphs53612603510.22108/toc.2021.126283.1792ENSankariCDepartment of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than-
javur, Tamil Nadu, India0000-0003-3325-7163SangeethaRDepartment of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than-
javur, Tamil Nadu, India0000-0003-2726-0956K.ArthiDepartment of Mathematics, A. V. V. M. Sri Pushpam College( Affiliated to Bharathidasan University), Poondi, Than-
javur, Tamil Nadu, India0000-0002-0399-1343Journal Article20201205A 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$.https://toc.ui.ac.ir/article_26035_96affe6636624d4a3ebc38ddb0989312.pdf