| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9505835 | Advances in Applied Mathematics | 2005 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Nolan McMurray, Talmage James Reid, Bing Wei, Haidong Wu,