Date Thesis Awarded
Summer 7-2012
Access Type
Honors Thesis -- Access Restricted On-Campus Only
Degree Name
Bachelors of Science (BS)
Department
Mathematics
Advisor
Gexin Yu
Committee Members
C. Ryan Vinroot
Weizhen Mao
Abstract
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.
Recommended Citation
Soosiah, Jeffrey, "Perfect Partitions of Some (0,1)-Matrices" (2012). Undergraduate Honors Theses. William & Mary. Paper 861.
https://scholarworks.wm.edu/honorstheses/861
Creative Commons License
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 License.
Comments
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.