A characterization for sparse -regular pairs.
A density result for random sparse oriented graphs and its relation to a conjecture of Woodall.
A local limit theorem for the critical random graph.
A Markov chain approach to randomly grown graphs.
A note on domination parameters in random graphs
Domination parameters in random graphs G(n,p), where p is a fixed real number in (0,1), are investigated. We show that with probability tending to 1 as n → ∞, the total and independent domination numbers concentrate on the domination number of G(n,p).
A note on random minimum length spanning trees.
A note on randomly complete -partite graphs
A note on sparse random graphs and cover graphs.
A note on the component structure in random intersection graphs with tunable clustering.
A note on the non-colorability threshold of a random graph.
A parametric analysis of the largest induced tree problem in random graphs
A -analogue of de Finetti's theorem.
A random graph model for power law graphs.
A stationary random graph of no growth rate
We present a random automorphism-invariant subgraph of a Cayley graph such that with probability 1 its exponential growth rate does not exist.
A stochastic complex network model society.
Airy phenomena and analytic combinatorics of connected graphs.
Almost all graphs with 2. 522 edges are not 3-colorable.
Almost every bipartite graph has not two vertices of minimum degree
An easy proof of the limit in the random assignment problem.
Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models.