Greedy clique sequences are a concept from graph theory that leads to three fast-growing functions. Defined by Harvey Friedman in 2010, the resulting functions are some of the strongest Friedman has ever defined.
| Graph IRI | Count |
|---|---|
| http://dbkwik.webdatacommons.org | 7 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
