166 citations · 387 across the 14 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010★ 60 cited
Exponentially many perfect matchings in cubic graphs
Louis Esperet, Frantisek Kardos, Andrew King +2
We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656) perfect matchings. This confirms an old conjecture of Lovasz and Plummer. This version of the paper uses a…
math.CO2010
Undecidability of linear inequalities in graph homomorphism densities
Hamed Hatami, Serguei Norine
The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between gr…