By making extensive use of connectivity properties of graphs the author gives new proofs of the following classical results: (1) For nonseparable graphs G, G' the cycle matroids M(G) and M(G') are isomorphic iff G and G' are 2-isomorphic (Whitney); (2) A binary matroid M is graphic iff none of \(F_ 7\), \(F_ 7^*\), \(M^*(K_ 5)\) and \(M^*(K_{3,3})\) is a minor of M (Tutte). The proofs are simpler and shorter and such lend themselves for use in introductory courses on this subject.
Recommendations
Cites work
- Connectivity in Matroids
- Decomposition of regular matroids
- Graph theory
- Graphs, matroids, and geometric lattices
- scientific article; zbMATH DE number 3179032 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Matroids and Graphs
- On matroid connectivity
- On Tutte's Characterization of Graphic Matroids
- On Whitney's 2‐isomorphism theorem for graphs
Cited in
(10)- On binary reducibility
- A 2-isomorphism theorem for hypergraphs
- A 2-isomorphism theorem for delta-matroids
- A short proof of Shih's isomorphism theorem on graphic subspaces
- scientific article; zbMATH DE number 3941560 (Why is no real title available?)
- scientific article; zbMATH DE number 4081581 (Why is no real title available?)
- scientific article; zbMATH DE number 634024 (Why is no real title available?)
- \(k\)-circular matroids of graphs
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- A new characterization of graphic matroids
This page was built for publication: On theories of Whitney and Tutte
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1070237)
