Limiting probabilities of first order properties of random sparse graphs and hypergraphs

DOI10.1002/rsa.21041zbMath1522.05494arXiv2008.09143OpenAlexW3194743542MaRDI QIDQ6074693

Tobias Müller, Marc Noy, Unnamed Author

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.09143

zbMATH Keywords

first order logiclogical limit lawssparse random graphs and hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Classical first-order logic (03B10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Component structure in the evolution of random hypergraphs
• The phase transition in a random hypergraph
• Logical limit laws for minor-closed classes of graphs
• Introduction to Random Graphs
• Probabilities of Sentences about Very Sparse Random Graphs
• Can you feel the double jump?
• On a paper of Guthrie and Nymann on subsums of infinite series
• Paths in graphs
• Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas

This page was built for publication: Limiting probabilities of first order properties of random sparse graphs and hypergraphs