论文信息 - Extremal Graph Theory

Extremal Graph Theory

3 Third Lecture 11 3.1 Applications of the Zarankiewicz Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 The Turán Problem for Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.3 The Girth Problem and Moore’s Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.4 Application of Moore’s Bound to Graph Spanners . . . . . . . . . . . . . . . . . . . . . . . 14

A. Shapira | G. Rutenberg

[1] Noga Alon,et al. Stability-type results for hereditary properties , 2009, J. Graph Theory.

[2] Noga Alon,et al. What is the furthest graph from a hereditary property? , 2008, Random Struct. Algorithms.

[3] Noga Alon,et al. The maximum edit distance from hereditary graph properties , 2008, J. Comb. Theory, Ser. B.

[4] Maria Axenovich,et al. On the editing distance of graphs , 2008, J. Graph Theory.

[5] Maria Axenovich,et al. Avoiding Patterns in Matrices Via a Small Number of Changes , 2016, SIAM J. Discret. Math..

[6] Béla Bollobás,et al. Highly linked graphs , 1996, Comb..

[7] Fan Chung Graham,et al. Quasi-random graphs , 1988, Comb..

[8] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .

[9] K. F. Roth. On Certain Sets of Integers , 1953 .

[10] F. Behrend. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[11] E. Szemeri~di,et al. On Sets of Integers Containing No Four Elements in Arithmetic Progression , .