Skip to main content
Log in

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(np) be the complete multipartite graph with p parts, each of size n. If \(V_{1},\ldots , V_{p}\) are the p parts of V(K(np)), then a holey k -factor of deficiency \(V_{i}\) of K(np) is a k-factor of \(K(n,p)-V_{i}\) for some i satisfying \(1\le i \le p\). Hence a holey k -factorization is a set of holey k-factors whose edges partition E(K(np)). Representing each (holey) k-factor as a color class in an edge-coloring, a (holey) k-factorization of K(np) is said to be fair if between each pair of parts the color classes have size within one of each other (so the edges are shared “evenly” among the permitted (holey) factors). In this paper the existence of fair 1-factorizations of K(np) is completely settled, as is the existence of fair holey 1-factorizations of K(np). The latter result can be used to provide a new construction for symmetric quasigroups of order np with holes of size n. Such quasigroups have the additional property that the permitted symbols are shared as evenly as possible among the cells in each \(n \times n\) “box”. These quasigroups are in some sense as far from frames produced by direct products as possible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bahmanian, M.A., Rodger, C.A.: Multiply balanced edge colorings of multigraphs. J. Graph Theory 70, 297–317 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bryant, D.: Hamilton cycle rich two-factorizations of complete graphs. J. Comb. Des. 12, 147–155 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Buchanan, H.: Graph factors and hamiltonian decompositions. Ph.D. Dissertation, University of West Virginia (1997)

  4. Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, Boca Raton (2006)

    Book  MATH  Google Scholar 

  5. Hilton, A.J.W.: Hamilton decompositions of complete graphs. J. Comb. Theory Ser. B 36, 125–134 (1984)

    Article  MATH  Google Scholar 

  6. Hilton, A.J.W., Rodger, C.A.: Hamilton decompositions of complete regular \(s\)-partite graphs. Discret. Math. 58, 63–78 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Laskar, R., Auerbach, B.: On the decompositions of \(r\)-partite graphs into edge-disjoint Hamilton circuits. Discret. Math. 14, 146–155 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Leach, C.D., Rodger, C.A.: Non-disconnecting disentanglements of amalgamated \(2\)-factorizations of complete multipartite graphs. J. Comb. Des. 9, 460–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Leach, C.D., Rodger, C.A.: Fair Hamilton decompositions of complete multipartite graphs. J. Comb. Theory Ser. B 85, 290–296 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Leach, C.D., Rodger, C.A.: Hamilton decompositions of complete multipartite graphs with any \(2\)-factor leave. J. Graph Theory 44, 208–214 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lucas, É.: Récréations Mathématiques, vol. 2. Gauthiers Villars, Paris (1892)

    MATH  Google Scholar 

  12. McCauley, L., Rodger, C.A.: Hamilton cycle rich 2-factorizations of complete multipartite graphs. Graphs Comb. 24, 47–52 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Petersen, J.: Die Theorie der regulären Graphs. Acta Mathematica 15, 193–220 (1891)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. A. Rodger.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Erzurumluoğlu, A., Rodger, C.A. Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs. Graphs and Combinatorics 32, 1375–1388 (2016). https://doi.org/10.1007/s00373-015-1648-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1648-9

Keywords

Mathematics Subject Classification

Navigation