A note on triangle-free and bipartite graphs

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 531-540

  Prömel, Hans Jürgen ^a   Schickinger, Thomas ^b   Steger, Angelika ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Asymptotic graph theory; Inductive counting; Random graphs; Triangle free graphs

Indexed keywords

EID: 33746051588     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00511-3     Document Type: Article

References (10)

1. n-free graphs, in: International Colloquium on Combinatorial Theory, Vol. 2, Atti dei Convegni Lincei, Roma, 1976, pp. 19-27.
2. D.J. Kleitman, B.L. Rothschild, The number of finite topologies, Proc. Amer. Math. Soc. 25 (1970) 276-282.
3. D.J. Kleitman, B.L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205 (1975) 205-220.
4. l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303 (1987) 637-671.
5. E. Lamken, B.L. Rothschild, The number of odd-cycle-free graphs, in: A. Hajnal, L.Lovász, V.T. Sós, (Eds.), Colloquia Mathematica Societalies János Bolyai, Vol. 37, North-Holland, Amsterdam, 1984, pp. 547-553.
6. H.J. Prömel, A. Steger, Almost all Berge graphs are perfect, Combin. Probab. Comput. 1 (1992) 53-79.
7. l+1-free graphs in linear expected time, Random Struct. Algorithms 3 (1992) 374-402.
8. H.J. Prömel, A. Steger, Random l-colorable graphs, Random Struct. Algorithms 6(1) (1995) 21-37.
9. H.J. Prömel, A. Steger, A. Taraz, Asymptotic enumeration, global structure and constrained evolution, Discrete Math. 229 (2001) 213-233.
10. A. Steger, Asymptotic properties of H-free graphs, Habilitationsschrift, Universität Bonn, 1993.