Existential closure in uniform hypergraphs

DOI10.1016/J.DISC.2024.114372MaRDI QIDQ7028857zbMATH OpenFDO

Authors Andrea Burgess, Robert D. Luther, David A. Pike

Publication date 11 February 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114372

zbMATH Keywords

block designsexistential closurehypergraphsrandom hypergraphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Asymmetric graphs
• Connection and separation in hypergraphs
• Connectivity in hypergraphs
• Graphs which contain all small graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 6473829 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3912417 (Why is no real title available?)
• scientific article; zbMATH DE number 878895 (Why is no real title available?)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On an adjacency property of almost all graphs
• Paley graphs satisfy all first-order adjacency axioms
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• The search for N-e.c. Graphs
• Vertex-transitive self-complementary uniform hypergraphs
• Vertex-transitive self-complementary uniform hypergraphs of prime order

This page was built for publication: Existential closure in uniform hypergraphs

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