Packing and covering with matroid circuits
โ Scribed by P.D Seymour
- Book ID
- 107884118
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 449 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We verify a conjecture regarding circuits of a binary matroid. A circuit cover of a integer-weighted matroid (M, p) is a list of circuits of M such that each element e is in exactly p(e) circuits from the list. We characterize those binary matroids for which two obvious necessary conditions for a we
We study the problem of covering or packing a finite group with subgroups of a specified order and obtain bounds on the size of such covers and packings. Our main results provide characterizations of the elementary abelian groups by the existence of large packings or small covers, respectively. Henc