• Corpus ID: 119152514

Connectivity of single-element coextensions of a binary matroid

@article{Mundhe2018ConnectivityOS,
  title={Connectivity of single-element coextensions of a binary matroid},
  author={Ganesh Mundhe and Y. M. Borse},
  journal={arXiv: Combinatorics},
  year={2018}
}
Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected. 

References

SHOWING 1-8 OF 8 REFERENCES
Forbidden-minor characterization for the class of cographic element splitting matroids
In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K4).
Forbidden-minor characterization for the class of graphic element splitting matroids
TLDR
The problem of determining precisely which graphic matroids M have the property that the element splitting operation, by every pair of elements on M yields a graphic matroid is solved by proving that there is exactly one minor-minimal matroid that does not have this property.
A classification of 4-connected graphs
Matroid theory
TLDR
The current status has been given for all the unsolved problems or conjectures that appear in Chapter 14 and the corrected text is given with the inserted words underlined.
A theory of 3-connected graphs
The cocircuits of splitting matroids
  • J. Indian Math. Soc. 74 No. 3-4
  • 2007
Some new operation on matroids and related results
  • Ph. D. Thesis, University of Pune
  • 2005
Generalized splitting operation for binary matroids and related results
  • Ph. D. Thesis, University of Pune
  • 2001