On the structure of clique-free graphs

Random Structures and Algorithms

Volumn 19, Issue 1, 2001, Pages 37-53

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

^a HUMBOLDT UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035640317     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.1017     Document Type: Article

References (6)

1. B. Bollobás and P. Erdos, On the structure of edge graphs, Bull London Math Soc 5 (1973), 317-321.
2. n-free graphs, In International Colloquium on Combinatorial Theory, Vol. 2 Atti dei Convegni Lincei, Rom., (1976), 19-27.
3. D. J. Kleitman and 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. H. J. Prömel, T. Schickinger, and A. Steger, A note on triangle-free and bipartite graphs, In special issue of Discrete Mathematics in honor of the 65th birthday of Daniel J. Kleitman, to appear.
6. H. J. Prömel, A. Steger, and A. Taraz, Asymptotic enumeration, global structure and constrained evolution, Discrete Math 229 (2001), 213-233.