https://diestel-graph-theory.com/
The corresponding print edition will appear with Springer later this year - no idea how long they will take.
Quite a few things are new in this edition, including:
- Two new sections on how to apply the regularity lemma
(counting lemma, removal lemma, Szemerédi's theorem with proof of Roth's theorem)
- New chapter section on chi-boundedness
- Gallai's A-paths theorem
- Nash-Williams's cycle decomposition theorem for infinite graphs,
with proof from Laviolette's theorem
- New or substantially simplified proofs of...
- Lovász's perfect graph theorem
- Seymour's 6-flow theorem
- Turán's theorem
- Tutte's theorem about flow polynomials
- the Chvátal-Erdös theorem on Hamilton cycles
- the tree-of-tangles theorem for graph minors (two new proofs, one canonical)
- the 5-colour theorem :)
Reinhard Diestel
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
