The complexity of proving that a graph is Ramsey (Q1705815)

From MaRDI portal
Revision as of 00:37, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q61732573, #quickstatements; #temporary_batch_1711055989931)
scientific article
Language Label Description Also known as
English
The complexity of proving that a graph is Ramsey
scientific article

    Statements

    title
    The complexity of proving that a graph is Ramsey (English)
    0 references
    author
    Massimo Lauria
    0 references
    Pavel Pudlák
    0 references
    Vojtěch Rödl
    0 references
    Neil Thapen
    0 references
    publication date
    16 March 2018
    0 references
    Mathematics Subject Classification ID
    03F20
    0 references
    05C55
    0 references
    05C80
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6851152
    0 references
    zbMATH Keywords
    Ramsey graphs
    0 references
    OpenAlex ID
    W2568146197
    0 references
    Wikidata QID
    Q61732573
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1705815&oldid=33141690"
    Powered by MediaWiki