The complexity of proving that a graph is Ramsey (Q1705815): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568146197 / rank
 
Normal rank

Revision as of 20:25, 19 March 2024

scientific article
Language Label Description Also known as
English
The complexity of proving that a graph is Ramsey
scientific article

    Statements

    The complexity of proving that a graph is Ramsey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Ramsey graphs
    0 references
    0 references