Strictly balanced uniform hypergraphs and generalizations of zero-one law

DOI10.1016/J.DISC.2022.112835MaRDI QIDQ2124632zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

first-order logiczero-one lawrandom hypergraphstrictly balanced hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Model theory of finite structures (03C13) Hypergraphs (05C65)

Recommendations

• On the uniformly balancedness of graphs
• On uniformly balanced graphs
• scientific article; zbMATH DE number 701118
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
• scientific article; zbMATH DE number 4016947
• A note on the balanced hypergraphs
• Balanced extensions of graphs and hypergraphs
• A characterization of totally balanced hypergraphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• scientific article; zbMATH DE number 3865331

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Colorings of partial Steiner systems and their applications
• Counting connected graphs and hypergraphs via the probabilistic method
• Counting extensions
• Estimation of the number of maximal extensions in a random graph
• First order sentences about random graphs: small number of alternations
• Infinite spectra of first-order properties for random hypergraphs
• Limit points of spectra for first-order properties of random hypergraphs
• New versions of Suen's correlation inequality
• On the zero-one k-law extensions
• Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
• Strongly balanced graphs and random graphs
• The largest critical point in the zero-one k-law
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The strange logic of random graphs
• Threshold functions for small subgraphs
• Threshold spectra via the Ehrenfeucht game
• Universal zero-one k-law
• When does the zero-one k-law fail?
• Zero-One Laws for Sparse Random Graphs
• Zero-one \(k\)-law

Cited in

(1)

• Bounded quantifier depth spectrum for random uniform hypergraphs

This page was built for publication: Strictly balanced uniform hypergraphs and generalizations of zero-one law

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124632)