Properties of almost all graphs and complexes
作者： Andreas Blass , Frank Harary
关键词:
摘要: … almost all of these results as corollaries. To this end, we propose the first-order theory of almost all graphs … states that for each sequence of 2n distinct vertices in a graph (u,, . . . , u,, vl,. . . …
sci-hub.se 参考文章(15)
Casimir Kuratowski, Sur le problème des courbes gauches en Topologie Fundamenta Mathematicae. ,vol. 15, pp. 271- 283 ,(1930) , 10.4064/FM-15-1-271-283
Gerhard Ringel, Map Color Theorem ,(1974)
Robert James Riddell, Contributions to the theory of condensation Ph.D. Thesis. ,(1951)
Gary Chartrand, Dennis Geller, Stephen Hedetniemi, Graphs with Forbidden Subgraphs Journal of Combinatorial Theory, Series B. ,vol. 10, pp. 12- 41 ,(1971) , 10.1016/0095-8956(71)90065-7
E. M. Wright, For How Many Edges is a Graph Almost Certainly Hamiltonian? Journal of the London Mathematical Society. ,vol. s2-8, pp. 44- 48 ,(1974) , 10.1112/JLMS/S2-8.1.44
G. A. Dirac, A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs Journal of the London Mathematical Society. ,vol. s1-27, pp. 85- 92 ,(1952) , 10.1112/JLMS/S1-27.1.85
Walter Oberschelp, Kombinatorische Anzahlbestimmungen in Relationen Mathematische Annalen. ,vol. 174, pp. 53- 78 ,(1967) , 10.1007/BF01363123
E. M. Wright, The Proportion of Unlabelled Graphs which are Hamiltonian Bulletin of the London Mathematical Society. ,vol. 8, pp. 241- 244 ,(1976) , 10.1112/BLMS/8.3.241
Haim Gaifman, Concerning measures in first order calculi Israel Journal of Mathematics. ,vol. 2, pp. 1- 18 ,(1964) , 10.1007/BF02759729
Ronald Fagin, Probabilities on Finite Models Journal of Symbolic Logic. ,vol. 41, pp. 50- 58 ,(1976) , 10.1017/S0022481200051756