The linear q-hypergraph process

DOI10.37236/12303MaRDI QIDQ7016795zbMATH OpenFDO

Authors Sayok Chakravarty, Nicholas Spanier

Publication date 6 March 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12303

zbMATH Keywords

maximal linear hypergraphsrandom greedy process

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial probability (60C05)

Cites work

• A gentle introduction to the differential equation method and dynamic concentration
• Counting designs
• Dynamic concentration of the triangle‐free process
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• Large girth approximate Steiner triple systems
• Large triangle packings and Tuza's conjecture in sparse random graphs
• On a packing and covering problem
• On tail probabilities for martingales
• On the size of a random maximal graph
• Random triangle removal
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The triangle-free process

This page was built for publication: The linear \(q\)-hypergraph process

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