Breadth First Search, Triangle-Free Graphs and Brownian Motion
One major problem in the enumeration of random graphs concerns triangle-free graphs. In this paper we study Breadth First Search processes and the associated queues to compute in terms of Wright’s constants the number of triangle-free graphs. Next we prove that this number is equivalent to the number connected labelled graphs by using arguments of the Brownian excursion type.
Unable to display preview. Download preview PDF.
- A. Cayley, (1889) A theorem on trees Q. J. Pure Appl. Math., 23, 376–378.Google Scholar
- P. Chassaing, J.F. Marckert, M. Yor, (2000) The height and width of simple trees Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Ed. D. Gardy, A. Mokkadem. Birkhauser, 17–30.Google Scholar
- P. Chassaing, J.F. Marckert, (2001) Parking functions empirical processe and the width of rooted labelled trees Elect. Journ. Comb, 8.Google Scholar
- F. Harary and E. Palmer, (1973) Graphical Enumeration Academic Press.Google Scholar
- J.F. Marckert, A. Mokkadem, (2001) The depth first processes of Galton-Watson trees converge to the same Brownian excursion Preprint UVSQ 5601.Google Scholar
- R. Sedgewick et P. Flajolet, (1996) An Introduction to the Analysis of Algorithms Addison-Wesley.Google Scholar
- R. Sedgewick, (1988) Algorithms Addison Wesley.Google Scholar