News for hackers. Stuff that matters.
Re:Who Can Name the Bigger Number? (1999) by ThreeFx on Wednesday January 22, 2020 @06:26AM (#22116558)
Fun fact: The Kruskal Tree Theorem has been extended to undirected graphs (they form a quasi-wellordered set wrt the graph minor relationship), giving rise to an even faster growing sequence called the "Friedman's SSCG function".

The theorem is interesting for other reasons though: It allows us to define graph families by forbidding certain substructures.

There are no comments on this comment yet.