Edge cover time for regular graphs.
Page 1
Tauraso, Roberto (2008)
Journal of Integer Sequences [electronic only]
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Nets Hawk Katz (2006)
Collectanea Mathematica
In this paper, we rule out the possibility that a certain method of proof in the sums differences conjecture can settle the Kakeya Conjecture.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Mitra, Pradipta (2009)
The Electronic Journal of Combinatorics [electronic only]
Bodirsky, Manuel, Fusy, Eric, Kang, Mihyun, Vigerske, Stefan (2007)
The Electronic Journal of Combinatorics [electronic only]
Rath, Balazs, Toth, Balint (2009)
Electronic Journal of Probability [electronic only]
Ferdaous Kellil, Guy Rousseau (2008)
Rendiconti del Seminario Matematico della Università di Padova
Vakulenko, S.A., Grigoriev, D.Yu. (2005)
Zapiski Nauchnykh Seminarov POMI
Wojciech Kordecki, Anna Lyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
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).
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Page 1