Date Thesis Awarded
Bachelors of Science (BS)
C. Ryan Vinroot
For a given regular bipartite graph G, can we partition the set of all perfect matchings of G into subsets such that each subset gives a 1-factorization of G? Or equivalently, given a (0; 1)-matrix A and the set PA of permutation matrices componentwise less than A, can we partition PA into subsets so that the matrix sum of elements in each subset is A? If so, we say the graph G or the matrix A has a perfect partition. We focus our attention on a class of regular bipartite graphs, and show the existence of perfect partitions for two particular regular bipartite graphs of the class.
Soosiah, Jeffrey, "Perfect Partitions of Some (0,1)-Matrices" (2012). Undergraduate Honors Theses. Paper 861.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 License.