Perfect matchings in -regular graphs.

Noga Alon, Beverly Sackler, Vojtěch Rödl, Andrzej Ruci

Type: Article

Publication Date: 1998-01-01

Citations: 17

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Perfect Matchings in $\epsilon$-regular Graphs	1998	Noga Alon Vojtěch Rödl Andrzej Ruciński
+	Perfect matchings in regular bipartite graphs	1996	P. Katerinis N. Tsikopoulos
+	Nearly perfect matchings in regular simple hypergraphs	1997	Noga Alon Jeong Han Kim Joel Spencer
+	Perfect matchings in ε-regular graphs	1998	Noga Alon Vojtěch Rödl Andrzej Ruciński
+ PDF Chat	On the Number of Perfect Matchings and Hamilton Cycles in $\epsilon$-Regular Non-bipartite Graphs	2000	Alan Frieze
+	The maximum number of perfect matchings of semi-regular graphs	2015	Hongliang Lu David G. L. Wang
+	The number of disjoint perfect matchings in semi-regular graphs	2016	Hongliang Lu David G. L. Wang
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński
+	Matchings in regular graphs	1981	Denis Naddef William R. Pulleyblank
+	On the Perfect Matchings of Near Regular Graphs	2011	Xinmin Hou
+ PDF Chat	Maximum Matchings in Regular Graphs of High Girth	2007	Abraham D. Flaxman Shlomo Hoory
+	Perfect codes in regular graphs	1988	I. Dvořáková-Rulićová
+	Maximum matchings in regular graphs	2013	Dong Ye
+	Forbidden Induced Subgraphs for Perfect Matchings	2011	Katsuhiro Ota Gabriel Sueiro
+ PDF Chat	Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs	2018	Ashish Goel Michael Kapralov Sanjeev Khanna
+	Perfect matchings of a graph	1971	Ian Anderson
+	The Number of Perfect Matchings in Two Types of 3-Regular Graph	2014	Tang Baoxiang Han Ren
+	Random Matchings in Regular Graphs	1998	Jeff Kahn Jeong Han Kim
+	Perfect matchings in regular highly cyclically edge-connected graphs	2017	Edita Rollová
+	Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs	2024	Zemin Jin Weijia Zhou Ting Yu Yuefang Sun

Works That Cite This (16)

Action	Title	Year	Authors
+	A blow-up lemma for approximate decompositions	2017	Jaehoon Kim Daniela Kühn Deryk Osthus Mykhaylo Tyomkyn
+	Triangle Factors In Sparse Pseudo-Random Graphs	2004	Michael Krivelevich Benni Sudakov† Tibor Szabó
+	Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs	2006	Daniela Kühn Deryk Osthus
+ PDF Chat	On the number of Hamiltonian cycles in Dirac graphs	2003	Gábor N. Sárközy Stanley M. Selkow Endre Szemerédi
+	Approximately counting perfect and general matchings in bipartite and general graphs	2009	Wai Jing Law
+ PDF Chat	Strong edge colorings of uniform graphs	2004	Andrzej Czygrinow Brendan Nagle
+ PDF Chat	Extremal graph packing problems: Ore-type versus Dirac-type	2009	H. A. Kierstead Alexandr Kostochka Gexin Yu
+	An Algorithmic Embedding of Graphs via Perfect Matchings	1998	Vojtěch Rödl Andrzej Ruciński Michelle Wagner
+	Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds	2010	Petr A. Golovach Dieter Kratsch Jean-Fraņcois Couturier
+	A Permanent Approach to the Traveling Salesman Problem	2012	Nisheeth K. Vishnoi

Works Cited by This (1)

Action	Title	Year	Authors
+	Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix	1981	Dmitry Falikman