Nick Wormald

activity

20142017

most citedThe number of satisfying assignments of random regular k-SAT formulas

4 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2017

Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs

Pu Gao, Reshma Ramadurai, Ian M. Wanless +1

A graph $G$ whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching $M$ that contains exactly one edge of each colour. We refute…

math.CO2016★ 4 cited

The number of satisfying assignments of random regular k-SAT formulas

Amin Coja-Oghlan, Nick Wormald

Let $Φ$ be a random $k$ -SAT formula in which every variable occurs precisely $d$ times positively and $d$ times negatively. Assuming that $k$ is sufficiently large and that $d$ 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 $G_{0}$ in the common random graph models $G (n, m)$ and ${\cal G}(n,p)…