Edge cover time for regular graphs.
Edit distance and its computation.
Elementary proofs and the sums differences problem.
In this paper, we rule out the possibility that a certain method of proof in the sums differences conjecture can settle the Kakeya Conjecture.
Encores on cores.
Entrywise bounds for eigenvectors of random graphs.
Enumeration and asymptotic properties of unlabeled outerplanar graphs.
Erdős-Renyi random graphs forest fires self-organized criticality.
Etude du spectre pour certains noyaux sur un arbre
Evolution in random environment and structural instability.
Exact Expectation and Variance of Minimal Basis of Random Matroids
We formulate and prove a formula to compute the expected value of the minimal random basis of an arbitrary finite matroid whose elements are assigned weights which are independent and uniformly distributed on the interval [0, 1]. This method yields an exact formula in terms of the Tutte polynomial. We give a simple formula to find the minimal random basis of the projective geometry PG(r − 1, q).
Expected lengths of minimum spanning trees for non-identical edge distributions.