On k-Connected -Extensions of Binary Matroids
Abstract
Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The -extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and sufficient conditions to preserve k-connectedness of a binary matroid under the -extension operation. We also obtain a necessary and sufficient condition to get a connected matroid from a disconnected binary matroid using the -extension operation.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.