Mader Tools

Mader Tools

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 rest...

Full description

Bibliographic Details
Main Author:	Frank Göring
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	graph h-path separator [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:	https://dmtcs.episciences.org/3404/pdf

Similar Items

(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01)

On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01)

Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01)

Packing non-returning A-paths algorithmically
by: Gyula Pap
Published: (2005-01-01)

Fast separation in a graph with an excluded minor
by: Bruce Reed, et al.
Published: (2005-01-01)

On the $L(p,1)$-labelling of graphs
by: Daniel Gonçalves
Published: (2005-01-01)

A product formula for the TASEP on a ring
by: Erik Aas, et al.
Published: (2014-01-01)

Noncommutative Symmetric Hall-Littlewood Polynomials
by: Lenny Tevlin
Published: (2011-01-01)

An upper bound for the chromatic number of line graphs
by: Andrew D. King, et al.
Published: (2005-01-01)

Distance graphs with maximum chromatic number
by: Javier Barajas, et al.
Published: (2005-01-01)

Hamiltonian Chains in Hypergraphs
by: Gyula Y. Katona
Published: (2005-01-01)

Multigraph decomposition into multigraphs with two underlying edges
by: Miri Priesler, et al.
Published: (2005-01-01)

Counting Polyominoes on Twisted Cylinders
by: Gill Barequet, et al.
Published: (2005-01-01)

On the Minimum Number of Completely 3-Scrambling Permutations
by: Jun Tarui
Published: (2005-01-01)

Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation
by: Jean-Christophe Aval, et al.
Published: (2009-01-01)

Counting Shi regions with a fixed separating wall
by: Susanna Fishel, et al.
Published: (2011-01-01)

A Quantization of a theorem of Goulden and Jackson
by: Matjaž Konvalinka, et al.
Published: (2008-01-01)

Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01)

Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras
by: Gérard Duchamp, et al.
Published: (1997-01-01)

Colouring random geometric graphs
by: Colin J. H. McDiarmid, et al.
Published: (2005-01-01)

Equivalent Subgraphs of Order $3$
by: Tomoki Nakamigawa
Published: (2005-01-01)

Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
by: Marthe Bonamy, et al.
Published: (2016-05-01)

Honeycombs from Hermitian Matrix Pairs
by: Glenn Appleby, et al.
Published: (2014-01-01)

Packing Three-Vertex Paths in a Subcubic Graph
by: Adrian Kosowski, et al.
Published: (2005-01-01)

Structure of spaces of rhombus tilings in the lexicograhic case
by: Éric Rémila
Published: (2005-01-01)

A sufficient condition for bicolorable hypergraphs
by: David Défossez
Published: (2005-01-01)

Excluded subposets in the Boolean lattice
by: Gyula O.H. Katona
Published: (2005-01-01)

A Min-Max theorem about the Road Coloring Conjecture
by: Rajneesh Hegde, et al.
Published: (2005-01-01)

Discrepancy of Products of Hypergraphs
by: Benjamin Doerr, et al.
Published: (2005-01-01)

A polynomial expression for the Hilbert series of the quotient ring of diagonal coinvariants (condensed version)
by: J. Haglund
Published: (2011-01-01)

On the enumeration of column-convex permutominoes
by: Nicholas R. Beaton, et al.
Published: (2011-01-01)

Application of graph combinatorics to rational identities of type $A^\ast$
by: Adrien Boussicault, et al.
Published: (2009-01-01)

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
by: F. Descouens, et al.
Published: (2008-01-01)

A further correspondence between $(bc,\bar{b})$-parking functions and $(bc,\bar{b})$-forests
by: Heesung Shin, et al.
Published: (2009-01-01)

Affine permutations and rational slope parking functions
by: Eugene Gorsky, et al.
Published: (2014-01-01)

The purity of set-systems related to Grassmann necklaces
by: Vladimir Danilov, et al.
Published: (2014-01-01)

A bijection between shrubs and series-parallel posets
by: Frédéric Chapoton
Published: (2008-01-01)

Combinatorial properties of permutation tableaux
by: Alexander Burstein, et al.
Published: (2008-01-01)

The quasiinvariants of the symmetric group
by: Jason Bandlow, et al.
Published: (2008-01-01)

Combinatorial interpretation and positivity of Kerov's character polynomials
by: Valentin Féray
Published: (2008-01-01)