scientific article; zbMATH DE number 1286037

DOI<239::AID-RSA3>3.0.CO;2-3 10.1002/(SICI)1098-2418(199905)14:3<239::AID-RSA3>3.0.CO;2-3zbMath0930.60019MaRDI QIDQ4242579

Gregory Loren McColm

Publication date: 15 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

first-order logicrandom graphsGilbert graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Classical first-order logic (03B10) Zero-one laws (60F20)

Related Items

\( \gamma \)-variable first-order logic of preferential attachment random graphs ⋮ MSO 0-1 law for recursive random trees ⋮ On the typical case complexity of graph optimization ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs

Cites Work

• Parametrization over inductive relations of a bounded number of variables
• Nonconvergence, undecidability, and intractability in asymptotic problems
• Unit disk graphs
• Eventual periodicity and ``one-dimensional queries
• A splitting inequality
• Structure and complexity of relational queries
• Random Plane Networks
• A zero‐one law for a random subset
• The logic of ordered random structures
• Can you feel the double jump?
• Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic
• Random sparse unary predicates
• Random unary predicates: Almost sure theories and countable models
• Convergence in homogeneous random graphs
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item