Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)

DOI10.1016/j.disc.2018.04.021zbMath1387.05200OpenAlexW2802173117MaRDI QIDQ1752691

P. Paulraja, S. Ganesamurthy

Publication date: 24 May 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.021

zbMATH Keywords

path decompositionKneser graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Unnamed Item ⋮ Claw-decomposition of Kneser Graphs

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• A short proof of Kneser's conjecture
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• A combinatorical proof of Kneser's conjecture
• Decomposition of the Kneser graph into paths of length four
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Path Decompositions of Kneser and Generalized Kneser Graphs
• A New Short Proof of Kneser's Conjecture
• A textbook of graph theory