Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Asymptotics of the Upper Matching Conjecture
Liviu Ilinca
,
Jeff Kahn
Type:
Preprint
Publication Date:
2012-05-19
Citations:
0
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Asymptotics of the Upper Matching Conjecture
2012
Liviu Ilinca
Jeff Kahn
+
Asymptotics of the Upper Matching Conjecture
2013
Liviu Ilinca
J. Kahn
+
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
2014
Péter Csíkvári
+
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
2014
Péter Csíkvári
+
PDF
Chat
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
2017
Péter Csíkvári
+
Perfect Matchings in Hypergraphs and the Erd\H{o}s matching conjecture
2015
Jie Han
+
PDF
Chat
Maximum Matchings in Regular Graphs of High Girth
2007
Abraham D. Flaxman
Shlomo Hoory
+
Improved Bound on Vertex Degree Version of Erdős Matching Conjecture
2020
Mingyang Guo
Hongliang Lu
Yao‐Lin Jiang
+
Matching for Graphs of Bounded Degree
2008
Yijie Han
+
Low Weight Perfect Matchings
2020
Stefan Ehard
Elena Mohr
Dieter Rautenbach
+
Low Weight Perfect Matchings
2020
Stefan Ehard
Elena Mohr
Dieter Rautenbach
+
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
2016
Jie Han
+
Perfect Matchings in Hypergraphs and the Erdős matching conjecture
2015
Jie Han
+
PDF
Chat
Low Weight Perfect Matchings
2020
Stefan Ehard
Elena Mohr
Dieter Rautenbach
+
Factorially many maximum matchings close to the Erd\H{o}s-Gallai bound
2021
Stéphane Bessy
Johannes Pardey
Lucas Picasarri‐Arrieta
Dieter Rautenbach
+
The number of perfect matchings, and the sandwich conjectures, of random regular graphs
2021
Pu Gao
+
Exact minimum codegree threshold for $K^- _4$-factors
2015
Jie Han
Allan Lo
Andrew Treglown
Yi Zhao
+
Beating Greedy Matching in Sublinear Time
2022
Soheil Behnezhad
Mohammad Roghani
Aviad Rubinstein
Amin Saberi
+
Approximating the number of maximal near perfect matchings in dense graphs
2018
Yifan Jing
Akbar Rafiey
+
Sublinear Algorithms for $(1.5+ε)$-Approximate Matching
2022
Sayan Bhattacharya
P. Kiss
Thatchaphol Saranurak
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (7)
Action
Title
Year
Authors
+
An upper bound for the number of perfect matchings in graphs
2008
Shmuel Friedland
+
Combinatorial Matrix Functions and 1-Factors of Graphs
1970
Peter M. Gibson
+
PDF
Chat
A short proof of Minc's conjecture
1978
Alexander Schrijver
+
An Entropy Proof of Bregman's Theorem
1997
Jaikumar Radhakrishnan
+
Matchings and independent sets of a fixed size in regular graphs
2009
Teena Carroll
David Galvin
Prasad Tetali
+
PDF
Chat
On the Validations of the Asymptotic Matching Conjectures
2008
Shmuel Friedland
Elliot Krop
P. H. Lundow
Klas Markström
+
The maximum number of perfect matchings in graphs with a given degree sequence
2008
Noga Alon
Shmuel Friedland