Counting independent sets in graphs (Q2346574)

From MaRDI portal
Revision as of 02:57, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting independent sets in graphs
scientific article

    Statements

    title
    Counting independent sets in graphs (English)
    0 references
    author
    Wojciech Samotij
    0 references
    publication date
    2 June 2015
    0 references
    zbMATH Keywords
    Roth's theorem
    0 references
    sparse random sets of integers
    0 references
    enumerating method
    0 references
    cites work
    Q5520566
    0 references
    Q5625207
    0 references
    Hypergraph containers
    0 references

    Identifiers

    zbMATH DE Number
    6441977
    0 references
    OpenAlex ID
    W2963239130
    0 references
    arXiv ID
    1412.0940
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2346574&oldid=39023854"
    Powered by MediaWiki