The Editor's Corner: Finite Lists of Obstructions (Q3758846)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4008412
Language Label Description Also known as
default for all languages
No label defined
    English
    The Editor's Corner: Finite Lists of Obstructions
    scientific article; zbMATH DE number 4008412

      Statements

      The Editor's Corner: Finite Lists of Obstructions (English)
      0 references
      0 references
      1987
      0 references
      planar graphs
      0 references
      Kuratowski's theorem
      0 references
      Graph minors
      0 references
      This article reports on a new and very powerful theory that has recently been developed by \textit{Neil Robertson} and \textit{Paul Seymour}. This theory can be thought of as describing what it 'really is' about the family of planar graphs that makes Kuratowski's theorem true in that family, and consequently obtaining far-reaching generalizations of that theorem. Their work is being written up in a sequence of about 18 papers, whose total length in print may run to about 500 pages. Of these papers, at this moment 5 have already appeared [Graph minors, I, J. Comb. Theory, Ser. B 35, 39-61 (1983; Zbl 0521.05062), II, J. Algorithms 7, 309-322 (1986; Zbl 0611.05017), III, J. Comb. Theory, Ser. B 36, 49-64 (1984; Zbl 0548.05025), V, J. Comb. Theory, Ser. B 41, 92-114 (1986; Zbl 0598.05055), VI, J. Comb. Theory, Ser. B 41, 115-138 (1986; Zbl 0598.05042)] and 7 others are in various stages of completion. [See also the survey article of \textit{N. Robertson} and \textit{P. D. Seymour} in Surveys in Combinatorics 1985, Pap. 10th Br. Combin. Conf., Glasgow/Scotl. 1985, Lond. Math. Soc. Lect. Note Ser. 103, 153-171 (1985; Zbl 0568.05025).]
      0 references

      Identifiers