Chapter

Combinatorial Geometry and Graph Theory

Volume 3330 of the series Lecture Notes in Computer Science pp 25-33

Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph

  • Jin AkiyamaAffiliated withResearch Institute of Educational Development, Tokai University
  • , Midori KobayashiAffiliated withSchool of Administration and Informatics, University of Shizuoka
  • , Gisaku NakamuraAffiliated withResearch Institute of Educational Development, Tokai University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Let n ≥ 7. Then there exists a uniform covering of 2-paths with 6-paths in K n if and only if n ≡ 0,1,2 (mod 5).