0-1 Laws for maps

Random Structures and Algorithms

Volumn 14, Issue 3, 1999, Pages 215-237

  Bender, Edward A ^a   Compton, Kevin J ^b   Richmond, L Bruce ^c  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^b University of Michigan   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

0 1 law; Maps

Indexed keywords

EID: 0033420110     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199905)14:3<215::AID-RSA2>3.0.CO;2-K     Document Type: Article

References (35)

1. S. Abiteboul, K.J. Compton, and V. Vianu, Queries are easier than you thought (probably), Proc. ACM Symp on Principles of Database Systems, Association for Computing Machinery, 1992, pp. 32-42.
2. T. Behrendt, K. Compton, and E. Grädel, "Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions," Computer Science Logic, Springer-Verlag, Berlin, 1993, pp. 43-60.
3. E.A. Bender, Z.-C. Gao, W.D. McCuaig, and L.B. Richmond, Submaps of maps II: Cyclically k-connected planar cubic maps, J Combin Theory Ser B 55 (1992), 118-124.
4. E.A. Bender, Z.-C. Gao, and L.B. Richmond, Submaps of maps I-General 0-1 laws J Combin Theory Ser B 55 (1992), 104-117.
5. E.A. Bender, Z.-C. Gao, and L.B. Richmond, Almost all rooted maps have large representativity, J Graph Theory 18 (1994), 545-555.
6. E.A. Bender, Z.-C. Gao, and L.B. Richmond, Submap density and asymmetry results for two parameter map families, J Combinat Probab and Comput 6 (1997), 31-41.
7. E.A. Bender, Z.-C. Gao, L.B. Richmond, and N.C. Wormald, Asymptotic properties of rooted 3-connected maps on a surface, J Austral Math Soc Ser A 60 (1996), 31-41.
8. E.A. Bender and L.B. Richmond, Submaps of maps III: k-connected non-planar maps J Combin Theory Ser B 55 (1992), 125-132.
9. A. Blass and F. Harary, Properties of almost all graphs and complexes, J Graph Theory 3 (1979), 225-240.
10. W.G. Brown, Enumeration of quadrangular dissections of the disk Canad J Math 17 (1965), 302-317.
11. C.C. Chang and H.J. Keisler, "Model Theory," volume 73 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, third edition, 1990.
12. K. Compton "0-1 laws in logic and combinatorics," NATO Advanced Study Institute on Algorithms and Order, Ivan Rival, (Editor). Kluwer, Dordrecht, 1989, pp. 353-383.
13. K. Compton and E. Grädel, "Logical definability of counting functions," 9th IEEE Conf on Structure in Complexity Theory, IEEE Computer Society Press 1994 on 127-144.
14. R. Cori, Graphes planaires et systèmes de parenthèses, Technical report, Centre National de la Recherche Scientifique, Institute Blaise Pascal, Paris, 1969.
15. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer, Berlin, 1995.
16. J.R. Edmonds, A combinatorial representation for polyhedral surfaces, Notices Amer Math Soc 7 (1960), 646.
17. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund Math 49 (1961), 129-141.
18. R. Fagin, Probabilities on finite models, J Symbolic Logic 41 (1976), 50-58.
19. R. Fraïssé, Sur quelques classifications des systèmes de relations, Université d'Alger, Publications Scientifiques, Série A 1 (1954), 35-182 (English summary).
20. Z.-C. Gao, The number of rooted triangular maps on a surface, J Combin Theory Ser B 52 (1991), 236-249.
21. Z.-C. Gao, The asymptotic number of rooted 2-connected triangular maps on a surface, J Combin Theory Ser B 54 (1992), 102-112.
22. Z.-C. Gao, A pattern for the asymptotic number of rooted maps on surfaces, J Combin Theory Ser A 64 (1992), 246-264.
23. Y.V. Glebskiǐ, D.I. Kogan, M.I. Liogon'kiǐ, and V.A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Cybernetics 5 (1969), 142-154. English Translation.
24. J.E. Graver and M.E. Watkins, Combinatorics with Emphasis on the Theory of Graphs, Springer-Verlag, New York, 1977.
25. A. Jacques, "Constellations et graphes topologiques," Combinatorial Theory and its Applications (P. Erdos, A. Renyi, and Vera T. Sos, Editors) North-Holland, 1970, pp. 657-673.
26. V.A. Liskovets, Some asymptotical estimates for planar Eulerian maps, Combinat Probab and Comput 5 (1996), 131-138.
27. J.F. Lynch, Almost sure theories, Ann Math Logic 18 (1980), 91-135.
28. J.C. Oxtoby, Measure and Category, Springer-Verlag, New York, 1971.
29. L.B. Richmond and N.C. Wormald, Almost all maps are asymmetric, J Combin Theory Ser B 63 (1995), 1-7.
30. J. Spencer, Zero-one laws with variable probability, J Symbolic Logic 58 (1993), 1-14.
31. W.T. Tutte, "What is a map," New Directions in the Theory of Graphs, Academic Press, New York, 1973, pp. 309-325.
32. W.T. Tutte, Combinatorial oriented maps, Canad J Math 31 (1979), 986-1004.
33. W.T. Tutte, Graph Theory, Addison-Wesley, Reading, MA, 1984.
34. T.R.S. Walsh and A.B. Lehman, Counting rooted maps by genus I, J Combin Theory Ser B 13 (1972), 192-218.
35. P. Winkler, "Random structures and zero-one laws," Finite and Infinite Combinatorics in Sets and Logic, Kluwer, Dordrecht, 1993, pp. 399-420.