92 citations · 608 across the 67 of their papers we have counts for
Showing 2010 · math.COShow all
3 papers · 2 filters
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★ 3 cited
Covering line graphs with equivalence relations
L. Esperet, J. Gimbel, A. King
An equivalence graph is a disjoint union of cliques, and the equivalence number of a graph is the minimum number of equivalence subgraphs needed to cover the e…
math.CO2010★ 7 cited
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
L. Esperet, F. Kardos, D. Kral'
Lovasz and Plummer conjectured in the 1970's that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorh…