[Paper Review] When do two planted graphs have the same cotransversal matroid?

Federico Ardila, Amanda Ruiz|arXiv (Cornell University)|Sep 24, 2008

Advanced Combinatorial Mathematics6 references3 citations

TL;DR

This paper establishes that two planted graphs yield the same cotransversal matroid if and only if their saturations can be transformed into each other via a sequence of local swap operations. The authors introduce swap and saturation operations on planted graphs, prove they preserve the cotransversal matroid, and use duality with transversal matroids and Hall’s marriage theorem to characterize equivalence classes of presentations.

ABSTRACT

Cotransversal matroids are a family of matroids that arise from planted graphs. We prove that two planted graphs give the same cotransversal matroid if and only if they can be obtained from each other by a series of local moves.

Motivation & Objective

• To characterize when two planted graphs give rise to the same cotransversal matroid.
• To identify the minimal set of local transformations that preserve the cotransversal matroid structure.
• To establish a duality-based framework connecting cotransversal matroids to transversal matroids and their presentations.
• To resolve subtleties arising in the dual setting, particularly concerning maximality and uniqueness of presentations.
• To provide a complete combinatorial characterization of matroid equivalence in terms of graph operations.

Proposed method

• Introduce the swap operation on planted graphs: reversing edges and reassigning sinks under specific conditions.
• Define saturation of a planted graph as the maximal extension preserving the cotransversal matroid structure.
• Leverage matroid duality to relate cotransversal matroids to transversal matroids, using the fact that cotransversal matroids are duals of transversal matroids.
• Apply Hall’s marriage theorem and the dragon marriage condition to analyze matchings in the dual bipartite graph representation.
• Use the bijection between saturated planted graphs and maximal presentations of transversal matroids to translate graph operations into matching exchanges.
• Prove that matching exchanges in the dual transversal matroid correspond exactly to swap operations in the primal planted graph.

Experimental results

Research questions

• RQ1 When do two different planted graphs present the same cotransversal matroid?
• RQ2 What local graph operations preserve the cotransversal matroid structure?
• RQ3 How are the presentations of a cotransversal matroid related to one another via structural transformations?
• RQ4 What role does matroid duality play in characterizing equivalence of graph presentations?
• RQ5 Can the space of saturated presentations of a cotransversal matroid be connected via a finite set of elementary operations?

Key findings

• Two planted graphs give the same cotransversal matroid if and only if their saturations can be transformed into each other by a series of swap operations.
• The swap operation preserves the cotransversal matroid, as proven in Theorem 3.2.
• The saturation of a planted graph yields a unique maximal presentation of the dual transversal matroid.
• The dual transversal matroid has a unique maximal presentation, which corresponds to the saturated form of the original planted graph.
• The connectedness of the graph of saturated presentations follows from the fact that any two matchings in the dual bipartite graph can be connected via a sequence of matching exchanges, each corresponding to a swap.
• In Example 6.3, the nine saturated presentations of a cotransversal matroid on five elements form two isomorphism classes, with all members connected via swaps.