一、书籍

(1) J. A. Bondy and U. S. R. Murty, Graph Theory, Graduate Texts in Mathematics, Volume 244, Springer, New York (2008). --著名的图论基础书，有1976版和2008版

(2) R. J. Wilson, Introduction to Graph Theory (5th edition), Pearson, (2010). --一本比较薄的图论书，包含了基础知识，适合本科生

(3) D. B. West, Introduction to Graph Theory (2nd edition), Prentice Hall, (2001). --见 West 的网站 https://faculty.math.illinois.edu/~west/igt/

(4) R. Diestel, Graph Theory (5th edition), Graduate Texts in Mathematics, Volume 173, Springer, (2017).

(5) B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, Volume 184, Springer, New York (1998).

(6) N. Alon and J. H. Spencer, The Probabilistic Method (3rd edition), John Wiley & Sons, Inc., Hoboken, New Jersey (2008). --著名的概率方法书

(7) J. Bang-Jensen and G. Gutin, Digraphs: Theory Algorithms and Applications, (2nd edition), Springer, (2009). --关于有向图的教材

(8) C. Berge, Hypergraphs: combinatorics of finite sets, North Holland, (1989). --一本古老的超图书，东南大学出版社出版了该书的中文译本，由卜月华和张克民译

(9) R. A. Brualdi, Introductory Combinatorics (5th edition), Pearson Education International, (2010). --组合数学教材，机械工业出版社出版了该书的中文译本

(10) L. Lovász, Combinatorial Problems and Exercises (2nd edition), AMS Chelsea Publishing, (2007). --包含了大量组合数学的习题和解答

(11) M. Aigner and G. M. Ziegler, Proofs from The Book (4th edition), Springer-Verlag Berlin Heidelberg, (2010). --根据 P. Erdős 的建议写出来的《数学天书中的证明》，高等教育出版社有中译版

(12) 堵丁柱, 葛可一, 王杰, 计算复杂性导论, 高等教育出版社, (2002).

(13) Y. F. Zhao, Graph Theory and Additive Combinatorics: Exploring Structure and Randomness, to be published by Cambridge University Press. --Yufei Zhao (MIT) 的著作，值得一看

(14) T. Tao and V. H. Vu. Additive combinatorics, Cambridge: Cambridge Univ. Press, (2006). --陶哲轩和 Vu 写的加性组合书

(15) L. Lovász, Large networks and graph limits, American Mathematical Society, (2012). --著名的图极限书

(16) D. Cvetković, P. Rowlinson and S. Simić, An Introduction to The Theory of Graph Spectra, Cambridge Univ. Press, (2010). --图谱书

(17) B. Bollobás, Extremal Graph Theory, Dover Publications, INC., Mineola, NewYork (2004).

(18) B. Bollobás, Random Graphs (2nd edition), Cambridge University Press, (2011).

(19) R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory (2nd edition), John Wiley & Sons, New York (1990). --Ramsey 理论的著作

(20) A. Soifer (Editor), Ramsey theory: yesterday, today and tomorrow, Progress in Mathematics. Birkhäuser, Springer, New York (2011). --介绍了详细的 Ramsey 理论的历史

(21) A. Sheffer, Polynomial Methods and Incidence Theory, Cambridge University Press, (2022). --近年来比较有用的新方法

(22) H. Furstenberg, Recurrence in ergodic theory and combinatorial number theory, Princeton University Press, Princeton, N.J. (1981). --Furstenberg 提出的遍历论在组合中的应用

(23) R. P. Stanley, Enumerative Combinatorics (2nd edition), Cambridge University Press, (2012).

二、讲义

(1) David Conlon 的三个讲义：Ramsey theory; Extremal graph theory; Pseudorandom graphs.

(2) Ben Green 和 Avi Wigderson 在 The 22nd McGill Invitational Workshop on Computational Complexity (2010) 的分别关于 Additive Combinatorics 和 Representation theory of finite groups, and applications 的讲义.

(3) Yufei Zhao 的一些讲义，例如 Graph Theory and Additive Combinatorics、Probabilistic Methods in Combinatorics.

(4) Hong Liu 的一些讲义.

(5) Robert Morris 关于 Hypergraph container method 的讲义 The method of hypergraph containers.

三、综述

[1] I. Pak, What is a combinatorial interpretation? arXiv, 2022.

[2] K. S. Yow and S. Luo, Learning-Based Approaches for Graph Problems: A Survey, arXiv, 2022.

[3] J. H. Tu, A Survey on the k-Path Vertex Cover Problem, arXiv, 2022.

[4] X. G. Liu and S. M. Zhou, Eigenvalues of Cayley graphs, Electronic Journal of Combinatorics 29(2) (2022), #P2.9.

[5] M. Schaefer, The Graph Crossing Number andits Variants: A Survey, Electronic Journal of Combinatorics (2022), #DS21.

[6] W. H. Haemers, Hoffman's ratio bound, Linear Algebra and its Applications 617 (2021) 215–219.

[7] S. P. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics (2021), DS1.16.

[8] B. L. Currie et al., A Survey of Minimum Saturated Graphs, Electronic Journal of Combinatorics (2021), #DS19.

[9] J. A. Gallian, A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics (2021), #DS6.

[10] Y. Li, W. Liu and L. Feng, A survey on spectral conditions for some extremal graph problems, arXiv, 2021.

[11] A. Scott and P. Seymour, A survey of χ-boundedness, J. Graph Theory, 95 (2020), 473–504.

[12] F. Bonomo-Braberman et al., On some graph classes related to perfect graphs: A survey, Discrete Applied Mathematics 281 (2020) 42–60.

[13] D. Mubayi and A. Suk, A Survey of Hypergraph Ramsey Problems, (2020).

[14] H. Lei and Y. Shi, A survey on star edge-coloring of graphs, arXiv, 2020.

[15] M. Simonovits and E. Szemerédi, Embedding graphs into larger graphs results, methods, and problems, (2019).

[16] F. Lazebnik, The maximum number of colorings of graphs of given order and size: A survey, Discrete Mathematics 342 (2019), 2783-2791.

[17] J. Balogh, R. Morris and W. Samotij, The method of hypergraph containers, ICM (2018).

[18] B. Szegedy, From graph limits to higher order Fourier analysis, ICM (2018).

[19] H. Chen, Long rainbow paths and rainbow cycles in edge colored graphs–A survey, Applied Mathematics and Computation 317 (2018), 187–192.

[20] Y. Zhao, Extremal regular graphs independent sets and graph homomorphisms, The American Mathematical Monthly 124 (2017), 827-843.

[21] S. Lovett, Additive combinatorics and its applications in theoretical computer science, Theory of Computing Library, Graduate Surveys 8 (2016), 1–55.

[22] Seymour, Paul Hadwiger's conjecture. Open problems in mathematics, 417–437, Springer, [Cham], 2016.

[23] J. Verstraëte, Extremal problems for cycles in graphs, Recent Trends in Combinatorics, 2016.

[24] E. R. van Dam, J. H. Koolen and H. Tanaka, Distance-regular graphs, Electronic Journal of Combinatorics (2016), #DS22.

[25] S. Chatterjee, An introduction to large deviations for random graphs, Bull. Amer. Math. Soc. 53 (2016), 617-642.

[26] D. Conlon, J. Fox and B. Sudakov, Recent developments in graph Ramsey theory, in: Surveys in Combinatorics 2015, Cambridge Univ. Press, (2015), 49–118.

[27] S. Fujita, C. Magnant and K. Ozeki, Rainbow generalizations of Ramsey theory: a dynamic survey, Theory Appl. Graphs 0 (2014), Article 1.

[28] M. Chudnovsky, The Erdős–Hajnal Conjecture—A Survey, J. Graph Theory 75: 178–190, 2014.

[29] J. Fox, The graph regularity method variants, applications, and alternative methods, ICM (2014).

[30] D. Conlon, Combinatorial theorems relative to a random set, ICM (2014).

[31] D. Conlon, J. Fox and Y. Zhao, Extremal results in sparse pseudorandom graphs, Advances in Mathematics 256 (2014), 206–290.

[32] D. Galvin, Three tutorial lectures on entropy and counting, arXiv, 2014.

[33] A. Sheffer, Distinct Distances: Open Problems and Current Bounds, arXiv, 2014.

[34] M. Szegedy, The Lovász Local Lemma–A Survey, 2013.

[35] Z. Füredi and M. Simonovits, The History of Degenerate (Bipartite) Extremal Graph Problems, 2013.

[36] D. Conlon and J. Fox, Graph removal lemmas. Surveys in combinatorics 2013, 1–49, London Math. Soc. Lecture Note Ser., 409, Cambridge Univ. Press, Cambridge, 2013.

[37] H. Li, Generalizations of Dirac's theorem in Hamiltonian graph theory—A survey, Discrete Mathematics 313 (2013) 2034–2053.

[38] A. A. Razborov, Flag Algebras: an Interim Report, 2013.

[39] V. Rödl and M. Schacht, Extremal results in random graphs, 2013.

[40] B. Seamone, The 1-2-3 Conjecture and related problems-a survey, arXiv, 2012.

[41] H. J. Broersma, Z. Ryjáček and P. Vrána, How Many Conjectures Can You Stand? A Survey, Graphs and Combinatorics (2012) 28:57–75.

[42] A. Lubotzky, Expander Graphs in Pure and Applied Mathematics, Bull. Amer. Math. Soc. 49 (2012), 113-162.

[43] Y. Zhao, Szemerédi's Theorem via Ergodic Theory, 2012.

[44] J. Fox and B. Sudakov, Dependent random choice, Random Struct. Alg., 38, 68–99, 2011.

[45] P. Keevash, Hypergraph Turán Problems, 2011.

[46] B. Sudakov, Recent Developments in Extremal Combinatorics: Ramsey and Turan Type Problems, ICM, 2010.

[47] L. Lovász, Very large graphs, 2009.

[48] V. Nikiforov and C. C. Rousseau, Ramsey Goodness and Beyond, Combinatorica 29 (2) (2009) 227–262.

[49] T. Tao, The dichotomy between structure and randomness, arithmetic progressions, and the primes, ICM, 2006.

[50] T. Łuczak, Randomness and regularity, ICM, 2006.

[51] C. Borgs et al., Counting Graph Homomorphisms, 2006.

[52] V. Rosta, Ramsey theory applications, Electron. J. Combin. 11 (2004), Research Paper 89, 48 pp.

[53] Y. Kohayakawa and V. Rödl, Szemerédi's regularity lemma and quasi-randomness, 2003.

[54] J. Radhakrishnan, Entropy and Counting, 2003.

[55] E. R. van Dam and W. H. Haemers, Which graphs are determined by their spectrum? 2002.

[56] J. Komlós et al., The regularity lemma and its applications in graph, 2002.

[57] N. Alon, Discrete Mathematics: Methods and challenges, ICM, 2002.

[58] J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, 1996.

[59] M. Simonovits, Extremal graph problems, degenerate extremal problems, and supersaturated graphs, 1984.

[60] J. Nešetřil, Some nonstandard Ramsey-like applications, Theoret. Comput. Sci. 34 (1984), 3–15.