Greedy clique sequence

Greedy clique sequences are a concept from graph theory that lead to fast-growing functions. Defined by Harvey Friedman in 2010, the resulting functions are some of the strongest Friedman has ever defined.