0–1 laws for maps

✍ Scribed by Edward A. Bender; Kevin J. Compton; L. Bruce Richmond

• Book ID: 101271629
• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 298 KB
• Volume: 14
• Category: Article
• ISSN: 1042-9832
• DOI: 10.1002/(sici)1098-2418(199905)14:3<215::aid-rsa2>3.0.co;2-k

✦ Synopsis

A class of finite structures has a 0᎐1 law with respect to a logic if every property expressible in the logic has a probability approaching a limit of 0 or 1 as the Ž structure size grows. To formulate 0᎐1 laws for maps i.e., embeddings of graphs in a . surface , it is necessary to represent maps as logical structures. Three such representations are given, the most general being the full cross representation based on Tutte's theory of combinatorial maps. The main result says that if a class of maps has two properties, richness and large representativity, then the corresponding class of full cross representations has a 0᎐1 law with respect to first-order logic. As a corollary the following classes of maps on a surface of fixed type have a first-order 0᎐1 law: all maps, smooth maps, 2-connected maps, 3-connected maps, triangular maps, 2-connected triangular maps, and 3-connected triangular maps.