Decomposition of the Kneser graph into paths of length four

DOI10.1016/j.disc.2015.02.011zbMath1310.05176OpenAlexW2026988243MaRDI QIDQ2342612

C. A. Rodger, T. R. III Whitt

Publication date: 29 April 2015

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

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

zbMATH Keywords

graph decompositionpath decompositionKneser graph

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Existence of Steiner quadruple systems with a spanning block design
• A short proof of Kneser's conjecture
• Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• A combinatorical proof of Kneser's conjecture
• 4-Cycle Group-Divisible Designs with Two Associate Classes
• Path Decompositions of Kneser and Generalized Kneser Graphs
• On the construction of odd cycle systems
• A New Short Proof of Kneser's Conjecture
• Cyclic decompositions of complete graphs into spanning trees

This page was built for publication: Decomposition of the Kneser graph into paths of length four