On properties of a matroid connected with the construction of bijunctive consequences of Boolean equations systems

The article is devoted to the study of linear dependencies in a set of Boolean functions represented by elementary conjunctions of length 2. Values of the number of minimal linearly dependent sets of a special type and lower estimates of the number of linearly independent sets of a given cardinality are obtained.