Asymptotic results on saturated graphs
From MaRDI portal
Publication:1174171
DOI10.1016/0012-365X(91)90140-WzbMath0737.05058WikidataQ127647026 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
05C35: Extremal problems in graph theory
05C30: Enumeration in graph theory
05A16: Asymptotic enumeration
Related Items
MinimumK2, 3-Saturated Graphs, Asymptotic growth of sparse saturated structures is locally determined, Cycle-saturated graphs of minimum size, Saturation numbers for disjoint stars, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, Graph cover-saturation
Cites Work