The independent domination number of a random graph
We prove a two-point concentration for the independent domination number of the random graph provided p²ln(n) ≥ 64ln((lnn)/p).
On the representation of as .
An asymptotic expansion for the number of permutations with a certain number of inversions.
Local extrema in random trees.
Multiplicities of integer arrays.
An asymptotic expansion for the Catalan-Larcombe-French sequence.
Central and local limit theorems for excedances by conjugacy class and by derangement.
Random subgraphs of certain graph powers.
Page 1