论文信息 - Perfect Matchings in ε-regular Graphs

Perfect Matchings in ε-regular Graphs

A super (d; )-regular graph on 2n vertices is a bipartite graph on the classes of vertices V1 and V2, wherejV1j =jV2j = n, in which the minimum degree and the maximum degree are between (d )n and (d + )n, and for every U V1;W V2 withjUj n

[1] Vojtech Rödl,et al. Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma , 1999, Comb..

[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3] H. Wilf. On the Permanent of a Doubly Stochastic Matrix , 1966, Canadian Journal of Mathematics.

[4] D. Falikman. Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , 1981 .