scientific article; zbMATH DE number 1286037
From MaRDI portal
Publication:4242579
DOI10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3zbMATH Open0930.60019MaRDI QIDQ4242579FDOQ4242579
Authors: Gregory Loren McColm
Publication date: 15 February 2000
Title of this publication is not available (Why is that?)
Recommendations
- Zero-one law for random subgraphs of some distance graphs with vertices in \( \mathbb Z^n\)
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
- Zero-one laws for graphs with edge probabilities decaying with distance. Part I
- Zero-one laws for random graphs with vertices in a Boolean cube
Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20) Classical first-order logic (03B10)
Cites Work
- Unit disk graphs
- Random Plane Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some remarks on the theory of graphs
- Title not available (Why is that?)
- Nonconvergence, undecidability, and intractability in asymptotic problems
- Structure and complexity of relational queries
- Parametrization over inductive relations of a bounded number of variables
- Eventual periodicity and ``one-dimensional queries
- A splitting inequality
- Can you feel the double jump?
- Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic
- Cybernetics
- A zero‐one law for a random subset
- Random sparse unary predicates
- Convergence in homogeneous random graphs
- Random unary predicates: Almost sure theories and countable models
- The logic of ordered random structures
Cited In (5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242579)