4 citations · 4 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 4 cited
The number of satisfying assignments of random regular k-SAT formulas
Amin Coja-Oghlan, Nick Wormald
Let be a random -SAT formula in which every variable occurs precisely times positively and times negatively. Assuming that is sufficiently large and that is…
math.CO2016
The probability of nonexistence of a subgraph in a moderately sparse random graph
Dudley Stark, Nick Wormald
We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph in the common random graph models and ${\cal G}(n,p)…