6 citations · 10 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Rainbow matchings in Dirac bipartite graphs
Matthew Coulson, Guillem Perarnau
We show the existence of rainbow perfect matchings in -bounded edge colourings of Dirac bipartite graphs, for a sufficiently small . As an application of our results, we o…
math.PR2017
Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
Matthew Coulson, Robert E. Gaunt, Gesine Reinert
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic…