Proof of the Seymour conjecture for large graphs (Q1272361)

From MaRDI portal
Revision as of 23:05, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60060518, #quickstatements; #temporary_batch_1711574657256)
scientific article
Language Label Description Also known as
English
Proof of the Seymour conjecture for large graphs
scientific article

    Statements

    title
    Proof of the Seymour conjecture for large graphs (English)
    0 references
    author
    Gábor N. Sárközy
    0 references
    János Komlós
    0 references
    Endre Szemerédi
    0 references
    publication date
    18 May 1999
    0 references
    zbMATH Keywords
    dense graphs
    0 references
    Hamiltonian cycle
    0 references

    Identifiers

    DOI
    10.1007/BF01626028
    0 references
    zbMATH DE Number
    1233910
    0 references
    Wikidata QID
    Q60060518
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1272361&oldid=33217370"
    Powered by MediaWiki