Summary: Perfect matchings in -regular graphs
School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540
and Department of Mathematics,
Raymond and Beverly Sackler Faculty of Exact Sciences,
Tel Aviv University, Tel Aviv, Israel; Email: email@example.com.
Department of Mathematics and Computer Science,
Emory University, Atlanta, USA; Email: firstname.lastname@example.org.
Department of Discrete Mathematics,
Faculty of Mathematics and Computer Science,
Adam Mickiewicz University, PoznaŽn, Poland;
Submitted: December 10, 1997; Accepted: February 8, 1998.
A super (d, )-regular graph on 2n vertices is a bipartite graph on the classes of vertices