|
|
||
Last update: prof. RNDr. Tomáš Bureš, Ph.D. (15.11.2019)
|
|
||
Last update: Mgr. Tereza Klimošová, Ph.D. (18.11.2019)
To learn the subject as described in the syllabus and be able to solve appropriate problems. |
|
||
Last update: Mgr. Tereza Klimošová, Ph.D. (18.11.2019)
Collected Papers of Paul Erdős up to 1989 S.P. Radziszowski, Small Ramsey numbers, The Electronic Journal of Combinatorics DS1: Mar 3, 2017 F.R.K. Chung, Open problems of Paul Erdős in graph theory, J. Graph Theory 25 (1997), 3-36. Ronald L. Graham and Fan R. K. Chung, Erdős on Graphs: His Legacy of Unsolved Problems. A K Peters, 1998. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley, 1995. R.L. Graham, B.L. Rothschild, and J.H. Spencer, Ramsey Theory, Wiley, 1990. E.M. Palmer, Graphical evolution. An introduction to the theory of random graphs, Wiley, 1985. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, 2016. V. Chvátal, A De Bruijn-Erdős theorem for graphs? In: Graph Theory Favorite Conjectures and Open Problems - 2, edited by Ralucca Gera, Teresa W. Haynes, and Stephen T. Hedetniemi, Springer Nature Switzerland (2018), pp. 149--176. |
|
||
Last update: prof. RNDr. Tomáš Bureš, Ph.D. (15.11.2019)
Proof of Bertrand's postulate. The Erdős-Szekeres, the Sylvester-Gallai, and the De Bruijn-Erdős theorems. Ramsey's theorem and Ramsey numbers. Delta-systems and Deza's proof of an Erdős-Lovász conjecture. Sperner's theorem and the Erdős-Ko-Rado theorem. Turán numbers. Property B and hypergraph colouring. Van der Waerden's theorem and van der Waerden numbers. Extremal graph theory. The Friendship Theorem, strongly regular graphs, and Moore graphs of diameter two. Chromatic number of graphs and the probabilistic method. The Erdős-Rényi random graphs and their evolution. Hamilton cycles. |