SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
作者： Paul Erdös
DOI: 10.1080/16073606.1993.9631741
关键词:
摘要: Abstract During my long life I published many papers with related titles. To keep this paper short will not give proofs and restrict myself to problems in graph theory, but try references make these as complete possible. start Turk type extremal theory.
sci-hub.se 参考文章(34)
A. Rényii, T. Sós, ON A PROBLEM OF GRAPH THEORY ,(1966)
T. Kóvari, V. Sós, P. Turán, On a problem of K. Zarankiewicz Colloquium Mathematicum. ,vol. 3, pp. 50- 57 ,(1954) , 10.4064/CM-3-1-50-57
Zolt�n F�redi, On a Turán type problem of Erdös Combinatorica. ,vol. 11, pp. 75- 79 ,(1991) , 10.1007/BF01375476
P. Erdös, G. Szckeres, A combinatorial problem in geometry Compositio Mathematica. ,vol. 2, pp. 463- 470 ,(2009) , 10.1007/978-0-8176-4842-8_3
Béla Bollobás, Extremal Graph Theory ,(1978)
Horst Sachs, On colour critical graphs fundamentals of computation theory. pp. 390- 401 ,(1985) , 10.1007/BFB0028823
D.J. Kleitman, K.J. Winston, The Asymptotic Number of Lattices Combinatorial Mathematics, Optimal Designs and Their Applications. ,vol. 6, pp. 243- 249 ,(1980) , 10.1016/S0167-5060(08)70708-8
P. Erdös, A. Hajnal, B. Rothchild, On chromatic number of graphs and set systems Cambridge Summer School in Mathematical Logic. ,vol. 17, pp. 531- 538 ,(1973) , 10.1007/BFB0066788
Paul Erdős, Ralph J Faudree, Cecil C Rousseau, Richard H Schelp, Subgraphs of minimal degree k Discrete Mathematics. ,vol. 85, pp. 53- 58 ,(1990) , 10.1016/0012-365X(90)90162-B
P. Erdős, M. Simonovits, An extremal graph problem Acta Mathematica Hungarica. ,vol. 22, pp. 275- 282 ,(1972) , 10.1007/BF01896420