| Full text | |
| Author(s): |
Lemos, Manoel
;
Reid, Talmage James
;
Wu, Haidong
Total Authors: 3
|
| Document type: | Journal article |
| Source: | EUROPEAN JOURNAL OF COMBINATORICS; v. 32, n. 6, p. 9-pg., 2011-08-01. |
| Abstract | |
Murty, in 1971, characterized the connected binary matroids with all circuits having the same size. We characterize the connected binary matroids with circuits of two different sizes, where the largest size is odd. As a consequence of this result we obtain both Murty's result and other results on binary matroids with circuits of only two sizes. We also show that it will be difficult to complete the general case of this problem. (C) 2011 Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures |
| Grantee: | Yoshiharu Kohayakawa |
| Support Opportunities: | PRONEX Research - Thematic Grants |