The number of elements belonging to triads in 3-connected binary matroids

In this paper, we obtain a sharp lower bound for the number of elements covered by triads in a minimally 3-connected binary matroid.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 339; no. 1; pp. 255 - 262
Main Authors Gomes, Antonio José Ferreira, Lemos, Manoel
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.01.2016
Subjects
3-connected
Binary
Matroid
Triad
Triangle
Triangle
Binary
Triad
3-connected
Matroid
Online AccessGet full text

Cover

More Information
Summary:In this paper, we obtain a sharp lower bound for the number of elements covered by triads in a minimally 3-connected binary matroid.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2015.08.014