About: Greedy clique sequence   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

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.

AttributesValues
rdfs:label
  • Greedy clique sequence
rdfs:comment
  • 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.
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • 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.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software