Aspects of connectivity with matroid constraints in graphs. (Aspects de la connexité avec contraintes de matroïdes dans les graphes)

The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development in this field, with the addition of matroid constraints.Firstly, we exhibit two reduction operations on connected graphs with matroid constraints. Using these operations, we generalize the Menger's theorem on connectivity and Edmond's theorem on packing of arborescences.However, this extension of Edmond's theorem does not ensure that the arborescences are spanning. It has been conjectured that one can always find such spanning arborescences. We prove this conjecture in some cases, including matroids of rank two and transversal matroids. We disprove this conjecture in the general case by providing a counter-example with more than 300 vertices, on a parallel extension of the Fano matroid.Finally, we explore other generalizations of connectivity with matroid constraints: in mixed graphs, hypergraphs and with reachability conditions.

[1]  Wolfgang Mader,et al.  Konstruktion aller n-fach kantenzusammenhängenden Digraphen , 1982, Eur. J. Comb..

[2]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[3]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on Decomposing a Hypergraph into K Connected Sub-hypergraphs on Decomposing a Hypergraph into K Connected Sub-hypergraphs , 2022 .

[4]  Robin W. Whitty.  Vertex-disjoint paths and edge-disjoint branchings in directed graphs , 1987, J. Graph Theory.

[5]  Konstantin Salikhov.  On the orientation of graphs , 2000, math/0012252.

[6]  András Frank,et al.  Packing Arborescences , 2009 .

[7]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[8]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[9]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.

[10]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[11]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[12]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[13]  L. Lovász.  A generalization of Kónig's theorem , 1970 .

[14]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[15]  András Frank,et al.  Variations for Lovász’ Submodular Ideas , 2008 .

[16]  D. R. Fulkerson,et al.  Transversals and Matroid Partition , 1965 .

[17]  Zoltán Szigeti,et al.  Old and new results on packing arborescences. , 2015 .

[18]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[19]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[20]  Shin-ichi Tanigawa,et al.  Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries , 2011, SIAM J. Discret. Math..

[21]  Andreas Huck.  Independent branchings in acyclic diagraphs , 1999, Discret. Math..

[22]  Zoltán Szigeti,et al.  On packing spanning arborescences with matroid constraint , 2017, Electron. Notes Discret. Math..

[23]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on the Orientation of Graphs and Hypergraphs on the Orientation of Graphs and Hypergraphs , 2022 .

[24]  Csaba Király,et al.  On Maximal Independent Arborescence Packing , 2016, SIAM J. Discret. Math..

[25]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[26]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[27]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[28]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[29]  William T. Tutte,et al.  A theory of 3-connected graphs , 1961 .

[30]  R. Rado.  Note on Independence Functions , 1957 .

[31]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[32]  Atsushi Takizawa,et al.  Arc-disjoint in-trees in directed graphs , 2008, SODA '08.

[33]  H. Robbins.  A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .

[34]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[35]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[36]  Yusuke Kobayashi,et al.  Algorithmic aspects of covering supermodular functions under matroid constraints , 2015 .

[37]  András Frank,et al.  Edge-Connection of Graphs, Digraphs, and Hypergraphs , 2006 .

[38]  Yusuke Kobayashi,et al.  Covering Intersecting Bi-set Families under Matroid Constraints , 2016, SIAM J. Discret. Math..

[39]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[40]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[41]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[42]  A. Frank.  An Algorithm for Submodular Functions on Graphs , 1982 .