William Cook

László Lovász

Paul D. Seymour

This is a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and the theory of computing, this book offers an in-depth look at many topics not treated in textbooks.

Papers from the DIMACS Special Year

Combinatorial Optimization

Neil Robertson

Robin Thomas

Two of the authors proved a well-known conjecture of K. Wagner, that in any infinite set of finite graphs there are two graphs so that one is a minor of the other. A key lemma was a theorem about the structure of finite graphs that have no $K_n$ minor for a fixed integer $n$. Here, the authors obtain an infinite analog of this lemma--a structural condition on a graph, necessary and sufficient for it not to contain a $K_n$ minor, for any fixed infinite cardinal $n$.

Paul D. Seymour

About

Books

Join the club