The cocycle lattice of binary matroids

László Lovász, Ákos Seress

Research output: Article

8 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)241-250
Number of pages10
JournalEuropean Journal of Combinatorics
Issue number3
Publication statusPublished - jan. 1 1993

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The cocycle lattice of binary matroids'. Together they form a unique fingerprint.

  • Cite this