• Title of article

    There is no universal countable random-free graph

  • Author/Authors

    Masasi Higasikawa، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    3
  • From page
    277
  • To page
    279
  • Abstract
    We consider embeddings between infinite graphs. In particular, we establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.
  • Keywords
    Infinite graph , Random graph , Strong embeddability
  • Journal title
    Discrete Mathematics
  • Serial Year
    2004
  • Journal title
    Discrete Mathematics
  • Record number

    948912

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=948912