• Title of article

    Erdős and Rényi Conjecture

  • Author/Authors

    Shelah، نويسنده , , Saharon، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    7
  • From page
    179
  • To page
    185
  • Abstract
    Affirming a conjecture of Erdős and Rényi we prove that for any (real number)c1>0 for somec2>0, if a graphGhas noc1(log n) nodes on which the graph is complete or edgeless (i.e.,Gexemplifies |G|↛(c1 log n)22), thenGhas at least 2c2nnon-isomorphic (induced) subgraphs.
  • Journal title
    Journal of Combinatorial Theory Series A
  • Serial Year
    1998
  • Journal title
    Journal of Combinatorial Theory Series A
  • Record number

    1530298

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