
On a kmatching algorithm and finding kfactors in random graphs with minimum degree k+1 in linear time
We prove that for k+1≥ 3 and c>(k+1)/2 w.h.p. the random graph on n vert...
read it

On the connectivity threshold for colorings of random graphs and hypergraphs
Let Ω_q=Ω_q(H) denote the set of proper [q]colorings of the hypergraph ...
read it
Michael Anastos
is this you? claim profile