CARMA Discrete Mathematics Seminar

3:00 pm

Thursday, 13th Aug 2015

V31, Mathematics Building

Dr Yuqing Lin

(School of Electrical Engineering and Computer Science, The University of Newcastle)

Edge disjoint perfect matchings in regular graph

Existing of perfect matchings in regular graph is a fundamental problem in graph theory, and it closely model many real world problems such as broadcasting and network management. Recently, we have studied the number of edge disjoint perfect matching in regular graph, and using some well-known results on the existence of perfect matching and operations forcing unique perfect matchings in regular graph, we are able to make some pleasant progress. In this talk, we will present the new results and briefly discuss the proof.