On the intersection problem for 1-factorizations and near 1-factorizations of Kυ

Authors

  • Bryant, Darryn E.
  • Khodkar A.

Abstract

The number of 1-factors (near 1-factors) that μ 1-factorizations (near 1-factorizations) of the complete graph Kυ, υ even (υ odd), can have in common, is studied. The problem is completely settled for μ = 2 and μ = 3.

Published

2001-06-09

How to Cite

Bryant, Darryn E., & Khodkar A. (2001). On the intersection problem for 1-factorizations and near 1-factorizations of Kυ. Utilitas Mathematica, 60. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/204

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.