A set {Fi of disjoint one-factors on n vertices is maximal if the complement of the graph ∪ Fi has no one-factor. We determine the spectrum of pairs {(n, ...

A set {e} of disjoint one-factors on n vertices is maximal if the complement of the graph IJ 4 has no one-factor. We determine the spectrum of pairs ((n, k): ...

Rees and W.D. Wallis, The spectrum of maximal set of one-factors, Research report Wcs g9-10 (19g9) , Mount Allison. University. (to appear in Discrete Math) ...

Jul 3, 2019 · So, the maximal spectrum is an infinite set with the cofinite topology, which is not Hausdorff. Share.

We present a sufficient condition for a regular p-partite graph to have a 2-factor. ... The spectrum of maximal sets of one-factors. Discrete Math. (1991). H.B. ...

If F has at least one i-factor, then F is called a proper premature set of one-factors. Maximal sets of i-factors in ~2n have been investigated. In this paper ...

Thus the spectrum for maximal sets of 1-factors is completely determined ... [29] Rees R., Wallis W. D., The spectrum of maximal sets of one-factors, (to.

In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These factors at times satisfy additional structural ...

Let M(2n) be the spectrum for maximal sets of 1-factors, i.e.. M(2n) = {m: there exists a maximal set of m edge-disjoint 1-factors in K2n}. As ...

Missing: factors. | Show results with:factors.