On the random greedy F-free hypergraph process

DOI10.1137/15M1050343MaRDI QIDQ3178438zbMATHOpenAlexFDO

Authors Daniela Kühn, Deryk Osthus, Amelia Taylor

Publication date 13 July 2016

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/15m1050343

zbMATH Keywords

extremal problemshypergraphsrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• On the random greedy F-free hypergraph process
• Dense subgraphs in the \(H\)-free process
• A note on the random greedy independent set algorithm
• Random maximalH-free graphs
• The early evolution of the \(H\)-free process

Cites work

• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• A note on the random greedy independent set algorithm
• Constrainted graph processes
• Dynamic concentration of the triangle-free process
• On the size of a random maximal graph
• Random maximalH-free graphs
• Representations of integers as the sum of k terms
• The C_ℓ‐free process
• The Final Size of the $C_{\ell}$-free Process
• The diamond-free process
• The early evolution of the \(H\)-free process
• The independent neighborhoods process
• The triangle-free process
• The triangle-free process and the Ramsey number \(R(3,k)\)
• When does the \(K_{4}\)-free process stop?

Cited in

(9)

• On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
• The random \(k\)-matching-free process
• Random hypergraph processes with degree restrictions
• On the random greedy linear uniform hypergraph packing
• On a conjecture of Erdős on locally sparse Steiner triple systems
• On the random greedy \(F\)-free hypergraph process
• The reverse \(H\)-free process for strictly 2-balanced graphs
• scientific article; zbMATH DE number 1890147 (Why is no real title available?)
• The Final Size of the $C_{\ell}$-free Process

This page was built for publication: On the random greedy \(F\)-free hypergraph process

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