On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
type: Item
instance of: scholarly article
title: On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
zbMATH Open document ID: 0860.05058
DOI: 10.1016/0012-365X(95)00157-R
author: D. G. Hoffman
author: C. A. Rodger
published in: Discrete Mathematics
publication date: 1997-01-14T00:00:00Z
review text: The authors investigate the maximum number of edge-disjoint 1-factors in \(K_{p_1,\dots,p_n}\), the complete multipartite graph with \(p_i\) vertices in the \(i\)th class. They settle this problems in the case where this number is greater than \(\delta(K_{p_1,\dots,p_n})-p_2\), where \(p_1\leq p_2\leq\cdots\leq p_n\), and \(\delta(G)\) is the minimum degree of graph \(G\). To do this they find necessary and sufficient conditions for the existence of a \(k\)-factor in \(K_{p_1,\dots,p_n}\).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 955153
zbMATH Keywords: 1-factors
zbMATH Keywords: complete multipartite graph
zbMATH Keywords: \(k\)-factor
reviewed by: Chris Jagger
MaRDI profile type: Publication
cites work: Generalized latin rectangles I: Construction and decomposition
cites work: Generalized latin rectangles. II: Embedding
cites work: Q5422499
cites work: 1-factorizing regular graphs of high degree - an improved bound
cites work: Q3287781
cites work: Méthode et théorème général de coloration des aretes d'un multigraphe
cites work: Hamiltonian decompositions of complete graphs
cites work: Hamiltonian decompositions of complete regular s-partite graphs
cites work: The embedding of partial triple systems when 4 divides \(\lambda\)
cites work: Class one graphs
cites work: The chromatic index of complete multipartite graphs
cites work: Q4386305
cites work: The Solution of a Timetabling Problem
cites work: Amalgamations of almost regular edge-colourings of simple graphs
cites work: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
cites work: Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
cites work: Graph factors
cites work: On A Particular Conference Scheduling Problem
Recommended article: Q3487420
Recommended article: On the edge-disjoint 1-factors in the power of connected graphs
Recommended article: On \(K_{1,k}\)-factorizations of a complete bipartite graph
Recommended article: Q3983257
Recommended article: \(K_{1,k}\)-factorization of complete bipartite graphs
Recommended article: Q5016980
Recommended article: On \(K_{1,k}\)-factorization of bipartite multigraphs
Recommended article: Edge-disjoint 1-factors in powers of connected graphs
Recommended article: \(K_{1,p^k}\)-factorization of complete bipartite graphs
Recommended article: The multiplicity of 1-factors in total graphs
description: scientific article; zbMATH DE number 955153