Schaefer's Theorem for Graphs (Q2796406)

From MaRDI portal
Revision as of 17:00, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Schaefer's Theorem for Graphs
scientific article

    Statements

    title
    Schaefer's Theorem for Graphs (English)
    0 references
    DOI
    10.1145/2764899
    0 references
    author
    Manuel Bodirsky
    0 references
    Michael Pinsker
    0 references
    publication date
    24 March 2016
    0 references
    Mathematics Subject Classification ID
    05C55
    0 references
    03B70
    0 references
    05C80
    0 references
    08A70
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6560187
    0 references
    zbMATH Keywords
    constraint satisfaction
    0 references
    Ramsey theory
    0 references
    computational logic
    0 references
    homogeneous structures
    0 references
    model theory
    0 references
    countable random graph
    0 references
    universal algebra
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2796406&oldid=3122782"
      Powered by MediaWiki