The asymptotic behaviour of sat(n, F)

DOI10.37236/13055MaRDI QIDQ7307912zbMATH OpenFDO

Authors Asier Calbet, Andrea Freschi

Publication date 3 August 2026

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

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• A survey of minimum saturated graphs
• Asymptotic results on saturated graphs
• scientific article; zbMATH DE number 2192110 (Why is no real title available?)
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• Saturated graphs with minimal number of edges
• The Minimum Size of Saturated Hypergraphs

This page was built for publication: The asymptotic behaviour of \(sat(n, \mathcal{F})\)

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