59 citations · 241 across the 37 of their papers we have counts for
4 papers · 1 filter
A class of Ramsey-extremal hypergraphs
Brendan D. McKay
In 1991, McKay and Radziszowski proved that, however each 3-subset of a 13-set is assigned one of two colours, there is some 4-subset whose four 3-subsets have the same colour. Mor…
The average number of spanning trees in sparse graphs with given degrees
Catherine Greenhill, Mikhail Isaev, Matthew Kwan +1
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the numb…
Complex martingales and asymptotic enumeration
Mikhail Isaev, Brendan D. McKay
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated…
On a bound of Hoeffding in the complex case
Mikhail Isaev, Brendan D. Mckay
It was proved by Hoeffding in 1963 that a real random variable X confined to [a, b] satisfies E e^(X--E X) e^((b--a)^2/8). We generalise this to complex random variables.