THE COCYCLE LATTICE OF BINARY MATROIDS

被引：8

作者：

LOVASZ, L

SERESS, A

机构：

[1] EOTVOS LORAND UNIV, H-1088 BUDAPEST, HUNGARY

[2] OHIO STATE UNIV, COLUMBUS, OH 43210 USA

[3] PRINCETON UNIV, PRINCETON, NJ 08544 USA

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1993年 / 14卷 / 03期

关键词：

D O I：

10.1006/eujc.1993.1027

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We study the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual lattice. We characterize those binary matroids for which the obvious characterization yields a polynomial time algorithm to check whether a matroid has this property, and also to construct a basis in the cocycle lattice. For the general case, we prove that every denominator in the dual lattice is a power of 2, and derive upper and lower bounds for the largest exponent. © 1993 Academic Press, Inc.

引用

页码：241 / 250

页数：10