92 citations · 608 across the 67 of their papers we have counts for
1 paper · 1 filter
Louis Esperet, Daniel Kral, Petr Skoda +1
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dime…