• Title of article

    Excluding a Countable Clique

  • Author/Authors

    Diestel، نويسنده , , REINHARD PEKRUN THOMAS GOETZ، نويسنده , , Robin، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1999
  • Pages
    27
  • From page
    41
  • To page
    67
  • Abstract
    We extend the excludedKnminor theorem of Robertson and Seymour to infinite graphs and deduce a structural characterization of the infinite graphs that have noKℵ0minor. The latter is a refinement of an earlier characterization of Robertson, Seymour, and the second author.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1999
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526488

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