Frank Göring - Mader Tools

dmtcs:3404 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3404
Mader Tools

Authors: Frank Göring 1

  • 1 Chemnitz University of Technology / Technische Universität Chemnitz

The deep theorem of Mader concerning the number of internally disjoint H-paths is a very powerfull tool. Nevertheless its use is very difficult, because one has to deal with a very reach family of separators. This paper shows several ways to strengthen Mader's theorem by certain additional restrictions of the appearing separators.


Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: graph,H-path,separator,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Consultation statistics

This page has been seen 132 times.
This article's PDF has been downloaded 212 times.