When do two planted graphs have the same cotransversal matroid?

zbMATH Open1247.05051MaRDI QIDQ423993FDOQ423993

Authors Federico Ardila, Amanda Ruiz

Publication date 30 May 2012

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.4250

zbMATH Keywords

saturationswappingcotransversal matroidplanted graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38)

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.

Recommendations

• Transversal and cotransversal matroids via their representations
• Basis pair graphs of transversal matroids are connected
• Matroids with different configurations and the same \(\mathcal{G} \)-invariant
• scientific article; zbMATH DE number 178980
• Which \(Q\)-cospectral graphs have same degree sequences
• Matroidal bijections between graphs
• Matroids having the same connectivity function
• Determining when a graphic matroid is transversal in linear time
• scientific article; zbMATH DE number 4081581
• Graphs with the same determinant as a complete graph

Cited in

(1)

• Infinite gammoids: minors and duality

This page was built for publication: When do two planted graphs have the same cotransversal matroid?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423993)