Friedman's SSCG function
id:
friedman-s-sscg-function-162-5905355
title:
Friedman's SSCG function
text:
In mathematics, a simple subcubic graph (SSCG) is a finite simple graph in which each vertex has a degree of at most three. Suppose we have a sequence of simple subcubic graphs G1, G2,... such that each graph Gi has at most i + k vertices (for some integer k) and for no i < j is Gi homeomorphically embeddable into (i.e. is a graph minor of) Gj. The Robertson–Seymour theorem proves that subcubic graphs (simple or not) are well-founded by homeomorphic embeddability, implying such a sequence cannot
brand slug:
wiki
category slug:
encyclopedia
description:
Fast-growing function
original url:
https://en.wikipedia.org/wiki/Friedman%27s_SSCG_function
date created:
2015-06-10T19:03:15Z
date modified:
2024-08-27T23:18:43Z
main entity:
{"identifier":"Q21014376","url":"https://www.wikidata.org/entity/Q21014376"}
image:
fields total:
13
integrity:
15