Some applications of matching theorems
This thesis contains the results of two investigations. The rst concerns the 1- factorizability of regular graphs of high degree. Chetwynd and Hilton proved in 1989 that all regular graphs of order 2n and degree 2n where > 1 2 ( p 7 1) 0:82288 are 1-factorizable. We show that all regular graphs o...
Main Author: | Vaughan, Emil Richard |
---|---|
Published: |
Queen Mary, University of London
2010
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535548 |
Similar Items
-
Matchings and covers of multipartite hypergraphs
by: Abu-Khazneh, Ahmad
Published: (2016) -
Some applications of discrete mathematics to the theory of communications
by: Wallace, Brian John Michael
Published: (2002) -
A stochastic Ramsey theorem
by: Xu, Zibo
Published: (2010) -
Some problems on graphs and designs
by: Johnson, Matthew
Published: (2002) -
Some topics in set theory
by: Lake, John
Published: (1973)