Friedman's SSCG function
Friedman's SSCG function is a mathematical function defined by Harvey Friedman. It is defined by SSCG(k) as the largest integer n satisfying the following:
There is a sequence G1,…,Gn of simple subcubic graphs such that each Gi has at most i+k vertices and for no i<j is Gi homeomorphically embeddable into Gj. Later, Friedman defined the more general subcubic graphs SCG(k).
Wikipedia contributors, "Friedman's SSCG function", Wikipedia, revision 1364595691, retrieved 20 November 2026, source, CC BY-SA 4.0.