4 citations · 4 across the 5 of their papers we have counts for
5 papers
Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs
Pu Gao, Reshma Ramadurai, Ian M. Wanless +1
A graph whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching that contains exactly one edge of each colour. We refute…
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…
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)…
It's a Small World for Random Surfers
Abbas Mehrabian, Nick Wormald
We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds…
Longest paths in random Apollonian networks and largest -ary subtrees of random -ary recursive trees
Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
Let and be positive integers with . Consider a random -ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random…