Elements belonging to triangles in 3-connected matroids

DOI10.1016/J.DISC.2006.05.025MaRDI QIDQ2433737zbMATH OpenOpenAlexFDO

Publication date 30 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.05.025

Combinatorial aspects of matroids and geometric lattices (05B35)

The author proves the following two theorems: Theorem 1. If \(M\) is a 3-connected matroid such that \(| E(M)| \geq 8\), then there are at least \({5 | E(M)| + 30 -15k \over 9}\) elements of \(M\) meeting some triangle of \(M\). Theorem 2. If \(M\) is a 3-connected matroid such that \(| E(M)| \geq 8\) and \(r(M) \geq 3\), then there are at least \({5r^*(M) +30-10k \over 7} \)elements of \(M\) meeting some triangle of \(M\). The author proves these results are sharp by constructing an infinite family of matroids that attain the bounds. An element \(e\) of a 3-connected matroid \(M\) is said to be superfluous provided \(M/e\) is 3-connected. Combining the above theorems, the author shows that a 3-connected matroid \(M\) with exactly \(k\) superfluous elements has at least \[ \max \bigg\{ {5 | E(M)| + 30 -15k \over 9},\;{5r^*(M) +30-10k \over 7}\bigg\} \] elements covered by triangles.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Elements belonging to triangles in 3-connected matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433737)