Document Type
Lecture
Publication Date
2-25-2009
Abstract
A matroid M is minimally k-connected if M is k- connected and, for every e E(M), Me is not k-connected. It is conjectured that every minimally k-connected matroid with E(M) 2(k 1) has a cocircuit of size k. We resolve the conjecture almost a rmatively for the case k = 4 by nding the unique counterexample. We also construct a counterexample to the conjecture with 2k + 1 elements for each k 5. This is joint work with Haidong Wu and Joe Zhou.
Relational Format
presentation
Recommended Citation
Reid, James, "On minimally k-connected matroids" (2009). Combinatorics Seminar. 82.
https://egrove.olemiss.edu/math_combinatorics/82
COinS
