| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603356 | Linear Algebra and its Applications | 2007 | 4 Pages |
Abstract
Smith conjectured that two distinct longest cycles of a k-connected graph meet in at least k vertices when kā©¾2. We prove an extension of this conjecture for 3-connected matroids.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
