Internally fair factorizations and internally fair holey factorizations with prescribed regularity

MaRDI QIDQ2401437zbMATH OpenFDO

Authors Aras Erzurumluoğlu, C. A. Rodger

Publication date 8 September 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p52

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

fair factorizationsgraph decompositionsholey factorizationsprescribed regularity

Mathematics Subject Classification ID

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

Review text

Summary: Let \(G\) be a multipartite multigraph without loops. Then \(G\) is said to be internally fair if its edges are shared as evenly as possible among all pairs of its partite sets. An internally fair factorization of \(G\) is an edge-decomposition of \(G\) into internally fair regular spanning subgraphs. A holey factor of \(G\) is a regular subgraph spanning all vertices but one partite set. An internally fair holey factorization is an edge-decomposition of \(G\) into internally fair holey factors. In this paper, we settle the existence of internally fair (respectively, internally fair holey) factorizations of the complete equipartite multigraph into factors (respectively, holey factors) with prescribed regularity.

Recommendations

• Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• scientific article; zbMATH DE number 1153449
• Homogeneous factorisations of complete multipartite graphs

Cites work

• Canonical edge-colourings of locally finite graphs
• Design theory.
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• Fair Hamilton decompositions of complete multipartite graphs
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• scientific article; zbMATH DE number 3468729 (Why is no real title available?)
• scientific article; zbMATH DE number 3353065 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• Multiply balanced edge colorings of multigraphs
• On A Particular Conference Scheduling Problem
• On evenly-equitable, balanced edge-colorings and related notions
• On the existence of cycle frames and almost resolvable cycle systems
• The CRC handbook of combinatorial designs

Cited in

(3)

• Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• scientific article; zbMATH DE number 1153449 (Why is no real title available?)

This page was built for publication: Internally fair factorizations and internally fair holey factorizations with prescribed regularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401437)