lasses of graphs without star forests and related graph



<span>10</span>

M. Albert, A. Atminas, and R. Brignall. Characterising inflations of monotone grid classes of permutations. J. Combin. Theory Ser. A, 154: 444-463, 2018.

V. E. Alekseev. Range of values of entropy of hereditary classes of graphs. Diskret. Mat., 4(2):148-157, 1992. In Russian; translation in Discrete Math. Appl. 3 (1993), no. 2, 191-199.

A. Atminas, A. Collins, V. Lozin, and V. Zamaraev. Implicit Representations and Factorial Properties of Graphs. J. Discrete Math. 338(2): 164-179, 2015.

N. Alon, J. Balogh, B. Bollobás, and R. Morris. The structure of almost all graphs in a hereditary property. J. Combin. Theory Ser. B, 101(2):85-110, 2011.

J. Balogh, B. Bollobás, and D. Weinreich. The speed of hereditary properties of graphs. J. Combin. Theory Ser. B, 79(2):131-156, 2000.

J. Balogh, B. Bollobás, and D. Weinreich. The penultimate rate of growth for graph properties. European J. Combin., 22(3):277-289, 2001.

J. Balogh, B. Bollobás, D. Weinreich, A jump to the Bell number for hereditary graph properties, J. Combin. Theory Series B 95 (2005), 29-48.

M. Chudnovsky and P. Seymour, Extending Gyárfás-Sumner conjecture, J. Combin. Theory Series B 105 (2014), 11-16.

P. Erds, P. Frankl, and V. Rödl. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin., 2(2):113-121, 1986

P. Erds, D. J. Kleitman, and B. L. Rothschild. Asymptotic enumeration of $K_n$-free graphs. In Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, number 17 in Atti dei Convegni Lincei, pages 19-27. Accad. Naz. Lincei, Rome, 1976.

S. Huczynska and V. Vatter, Grid classes and the Fibonacci dichotomy for restricted permutations, Electronic J. Combinatorics 13 (2006), R54, 14 pp.

T. Kaiser and M. Klazar, On growth rates of closed permutation classes, Electron. J. Combin. 9 (2003), no. 2, Research paper 10, 20 pp.

H. A. Kierstead and S. G. Penrice, Radius two trees specify $\chi$-bounded classes, J. Graph Theory 18 (1994), 119-129.

Ph. G. Kolaitis, H. J. Prömel, and B. L. Rothschild. $K_{l+1}$-free graphs: asymptotic structure and a 0-1 law. Trans. Amer. Math. Soc., 303(2):637-671, 1987

V. Lozin, C. Mayhill, V. Zamaraev, Locally bounded coverings and factorial properties of graphs, European J. Combinatorics 33 (2012), 534-543.

H. J. Prömel and A. Steger. Excluding induced subgraphs: quadrilaterals. Random Structures Algorithms, 2(1):55-71, 1991.

H. J. Prömel and A. Steger. Excluding induced subgraphs. III. A general asymptotic. Random Structures Algorithms, 3(1):19-31, 1992.

H. J. Prömel and A. Steger. Excluding induced subgraphs. II. Extremal graphs. Discrete Appl. Math., 44(1-3):283-294, 1993.

E. R. Scheinerman and J. S. Zito. On the size of hereditary classes of graphs. J. Combin. Theory Ser. B, 61(1):16-39, 1994.

V. Vatter. Small permutation classes. Proc. Lond. Math. Soc. (3) 103 (2011), 879-921.

[^1]: Department of Mathematics, London School of Economics, London, WC2A 2AE, United Kingdom, jay00@example.net

{'source': 'arXiv_out/1711'}