Few H copies in F‐saturated graphs

DOI10.1002/jgt.22525zbMath1485.05085arXiv1810.00939OpenAlexW2989984979MaRDI QIDQ5066892

Abhishek Methuku, Michael Tait, Craig Timmons, Jürgen Kritschgau

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00939

zbMATH Keywords

extremal graph theorygraph saturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Rainbow Saturation for Complete Graphs ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs

This page was built for publication: Few H copies in F‐saturated graphs