Extremal critically connected matroids |
| |
Authors: | USR Murty |
| |
Institution: | Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada |
| |
Abstract: | A connected matroid M is called a critically connected matroid if the deletion of any one element from M results in a disconnected matroid. We show that a critically connected matroid of rank n, n≥3, can have at most 2n?2 elements. We also show that a critically connected matroid of rank n on 2n?2 elements is isomorphic to the forest matroid of K2, n?2. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|