Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs

  • Jingjun BaoEmail author
  • Lijun Ji
Original Paper


A pair of orthogonal one-factorizations \(\mathcal F\) and \({\mathcal {G}}\) of the complete graph \(K_n\) is \(C_4\)-free if for any two factors \(F\in {\mathcal {F}}\) and \(G\in {\mathcal {G}}\) the union \(F\cup G\) does not include a cycle of length four. Such a concept was introduced by Blokhuis et al. (J Combin Theory B 82: 1–18, 2001), who used it to improve the upper bound for two-round rainbow colorings of \(K_n\). In this paper, we focus on constructions for a pair of orthogonal \(C_4\)-free one-factorizations of the complete graph \(K_n\). Some infinite classes of such orthogonal decompositions are obtained.


One-factorization Room square \(C_4\)-free 



The authors would like to thank the referees for carefully checking and many helpful comments on the paper. Part of the research of J. Bao was supported by NSFC grant 11701303 and the K. C. Wong Magna Fund in Ningbo University. Part of the research of L. Ji was supported by NSFC Grants 11871363, 11431003.


  1. 1.
    Alspach, B., Heinrich, K., Liu, G.: Orthogonal factorizations of graphs. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory, pp. 13–40. Wiley, New York (1992)Google Scholar
  2. 2.
    Blokhuis, A., Faudree, R., Gyárfás, A., Ruszinkó, M.: Anti-ramsey colorings in several rounds. J. Combin. Theory B 82, 1–18 (2001)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Heinrich, K.: Latin squares with and without subsquares of prescribed type. In: Denes, J., Keedwell, A.D. (eds.) Latin Squares: New Developments in the Theory and Applications, Ann. Discrete Math. 46, pp. 101–147. North-Holland, Amsterdam (1991)Google Scholar
  4. 4.
    Dickson, L.E.: Cyclotomy, higher congruences and Waring’s problem. Am. J. Math 57, 391–424 (1935)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dinitz, J.H., Dukes, P.: On the structure of uniform one-factorizations from starters in finite fields. Finite Fields Appl. 12, 283–300 (2006)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dinitz, J. H., Dukes, P., Stinson, D.R.: Sequentially perfect and uniform one-factorizations of the complete graph. Electron. J. Combin., 12, \(\sharp \) R1 (2005)Google Scholar
  7. 7.
    Horton, J.D.: Room designs and one-factorizations. Aequ. Math. 22, 56–63 (1981)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Horton, J.D.: Quintuplication of Room squares. Aequ. Math. 7, 243–245 (1971)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Mendelsohn, E., Rosa, A.: One-factorizations of the complete graph-a survey. J. Graph. Theory 9, 43–65 (1985)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Meszka, M.: \(k\)-cycle free one-factorizations of complete graphs. Electron. J. Combin., 16, \(\sharp \)R3 (2009)Google Scholar
  11. 11.
    Mullin, R.C., Nemeth, E.: A counterexample to a multiplicative construction of Room squares. J. Combin. Theory 7, 266–272 (1969)CrossRefGoogle Scholar
  12. 12.
    Phelps, K., Stinson, D.R., Vanstone, S.A.: The existence of simple \(S_3(3,4, v)\). Discrete Math. 77, 255–258 (1989)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Stanton, R.G., Horton, J.D.: A multiplication theorem for Room squares. J. Combin. Theory 12, 322–325 (1972)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Stanton, R.G., Mullin, R.C.: Construction of Room squares. Ann. Math. Stat. 39, 1540–1548 (1968)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Storer, T.: Cyclotomy and Difference Sets. Markham, Chicago (1967)zbMATHGoogle Scholar
  16. 16.
    Wallis, W.D.: One-factorizations of complete graphs. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory, pp. 593–631. Wiley, New York (1992)Google Scholar
  17. 17.
    Wallis, W.D.: A Room square of size \(257\). Congr. Numer. 8, 533 (1973)zbMATHGoogle Scholar

Copyright information

© Springer Japan KK, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathematicsNingbo UniversityNingboChina
  2. 2.Department of MathematicsSoochow UniversitySuzhouChina

Personalised recommendations