3 citations · 7 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020★ 3 cited
On the expected number of perfect matchings in cubic planar graphs
Marc Noy, Clément Requilé, Juanjo Rué
A well-known conjecture by Lovász and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Es…
math.CO2020
Cycles of given lengths in unicyclic components in sparse random graphs
Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana +1
Let be subset of and let be the number of cycles belonging to unicyclic components whose length is in in the random graph . We find…