论文信息 - Multimatroids II. Orthogonality, minors and connectivity

Multimatroids II. Orthogonality, minors and connectivity

A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on the coverings of a matroid by independent sets and a theorem of Jackson on the existence of pairwise compatible Euler tours in a 4-regular graph. Here we investigate some basic concepts and properties related with multimatroids: matroid orthogonality, minor operations and connectivity.

André Bouchet | A. Bouchet

[1] Timothy F. Havel,et al. Some Combinatorial Properties of Discriminants in Metric Vector Spaces , 1986 .

[2] Bill Jackson,et al. A characterisation of graphs having three pairwise compatible Euler tours , 1991, J. Comb. Theory, Ser. B.

[3] Norman Biggs,et al. ON THE FOUNDATIONS OF COMBINATORIAL THEORY: COMBINATORIAL GEOMETRIES , 1972 .

[4] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..

[5] Bill Jackson. Supplementary Eulerian vectors in isotropic systems , 1991, J. Comb. Theory, Ser. B.

[6] Jack Edmonds,et al. Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[7] André Bouchet,et al. Greedy algorithm and symmetric matroids , 1987, Math. Program..

[8] André Bouchet. Compatible Euler Tours and Supplementary Eulerian Vectors , 1993, Eur. J. Comb..

[9] Ramaswamy Chandrasekaran,et al. On totally dual integral systems , 1990, Discret. Appl. Math..