Proper minor-closed families are small

Serguei Norine, Paul Seymour, Robin Thomas, Paul Wollan

Research output: Contribution to journalArticlepeer-review

58 Scopus citations


We prove that for every proper minor-closed class I of graphs there exists a constant c such that for every integer n the class I includes at most n ! cn graphs with vertex-set {1, 2, ..., n}. This answers a question of Welsh.

Original languageEnglish (US)
Pages (from-to)754-757
Number of pages4
JournalJournal of Combinatorial Theory. Series B
Issue number5
StatePublished - Sep 2006

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


  • Graph
  • Minor
  • Minor-closed family


Dive into the research topics of 'Proper minor-closed families are small'. Together they form a unique fingerprint.

Cite this