The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements

DOI10.1137/21M1453852zbMath1497.05029arXiv2110.09636OpenAlexW4293581795MaRDI QIDQ5099105

Jagdeep Singh, James G. Oxley

Publication date: 31 August 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

binary matroidcomplementcographternary matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of matroids and geometric lattices (05B35)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• The micro-world of cographs
• Flows and generalized coloring theorems in graphs
• Some perfect coloring properties of graphs
• Complement reducible graphs
• On a class of posets and the corresponding comparability graphs
• Characterizations and algorithmic applications of chordal graph embeddings
• The rank of a cograph
• Upper bounds to the clique width of graphs
• On a property of the class of n-colorable graphs
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• A Linear Recognition Algorithm for Cographs
• Cocircuit coverings and packings for binary matroids
• Graph Classes: A Survey
• Connected hyperplanes in binary matroids
• On matroid connectivity

This page was built for publication: The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements