Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Perfect matchings in -regular graphs School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540
 

Summary: Perfect matchings in -regular graphs
Noga Alon

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: noga@math.tau.ac.il.
Vojtech Ršodl

Department of Mathematics and Computer Science,
Emory University, Atlanta, USA; Email: rodl@mathcs.emory.edu.
Andrzej RuciŽnski

Department of Discrete Mathematics,
Faculty of Mathematics and Computer Science,
Adam Mickiewicz University, PoznaŽn, Poland;
Email: rucinski@math.amu.edu.pl.
Submitted: December 10, 1997; Accepted: February 8, 1998.
Abstract
A super (d, )-regular graph on 2n vertices is a bipartite graph on the classes of vertices

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics