Random directed graphs are robustly Hamiltonian (Q2820274)

From MaRDI portal
Revision as of 12:53, 17 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
Random directed graphs are robustly Hamiltonian
scientific article

    Statements

    title
    Random directed graphs are robustly Hamiltonian (English)
    0 references
    author
    Dan Hefetz
    0 references
    Angelika Steger
    0 references
    Benjamin Sudakov
    0 references
    publication date
    15 September 2016
    0 references
    zbMATH Keywords
    random digraph
    0 references
    Hamilton cycle
    0 references
    resilience
    0 references

    Identifiers

    DOI
    10.1002/rsa.20631
    0 references
    Mathematics Subject Classification ID
    05C80
    0 references
    05C20
    0 references
    05C45
    0 references
    zbMATH DE Number
    6627528
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2820274&oldid=3146819"
      Powered by MediaWiki