Abstract

We extend to matroids Smith's Conjecture that any two distinct longest cycles of a k-connected graph meet in at least k vertices when k ⩾ 2 . We generalize several known results for graphs and matroids by proving the matroid conjecture in the case that k = 2 .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call