Asymptotic results on saturated graphs

DOI10.1016/0012-365X(91)90140-WzbMath0737.05058OpenAlexW2033944136WikidataQ127647026 ScholiaQ127647026MaRDI QIDQ1174171

Miroslaw Truszczynski, Zsolt Tuza

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90140-w

zbMATH Keywords

saturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (6)

Cycle-saturated graphs of minimum size ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Asymptotic growth of sparse saturated structures is locally determined ⋮ MinimumK_{2, 3}-Saturated Graphs ⋮ Graph cover-saturation ⋮ Saturation numbers for disjoint stars

Cites Work

• Saturated graphs with minimal number of edges
• A Problem in Graph Theory

This page was built for publication: Asymptotic results on saturated graphs