Strictly balanced uniform hypergraphs and generalizations of zero-one law
From MaRDI portal
Publication:2124632
DOI10.1016/j.disc.2022.112835zbMath1486.05217OpenAlexW4210964680MaRDI QIDQ2124632
Publication date: 11 April 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112835
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Model theory of finite structures (03C13)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When does the zero-one \(k\)-law fail?
- Universal zero-one \(k\)-law
- On the zero-one \(k\)-law extensions
- Zero-one \(k\)-law
- Threshold spectra via the Ehrenfeucht game
- First order sentences about random graphs: small number of alternations
- Infinite spectra of first-order properties for random hypergraphs
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Colorings of partial Steiner systems and their applications
- Counting extensions
- Limit points of spectra for first-order properties of random hypergraphs
- Zero-One Laws for Sparse Random Graphs
- Strongly balanced graphs and random graphs
- Threshold functions for small subgraphs
- New versions of Suen's correlation inequality
- Estimation of the number of maximal extensions in a random graph
- The largest critical point in the zero-one k-law
- Counting connected graphs and hypergraphs via the probabilistic method
- The strange logic of random graphs
This page was built for publication: Strictly balanced uniform hypergraphs and generalizations of zero-one law