AbstractA set L of linear polynomials in variables X1,X2,…,Xn with real coefficients is said to be an essential cover of the cube {0,1}n if(E1)for each v∈{0,1}n, there is a p∈L such that p(v)=0;(E2)no proper subset of L satisfies (E1), that is, for every p∈L, there is a v∈{0,1}n such that p alone takes the value 0 on v;(E3)every variable appears (in some monomial with non-zero coefficient) in some polynomial of L.Let e(n) be the size of the smallest essential cover of {0,1}n. In the present note we show that12(4n+1+1)⩽e(n)⩽n2+1
AbstractWe consider coverings of the Boolean n-cube Bn={0,1}n by families of its subsets of the spec...
AbstractA t-cover of a quadric Q is a set C of t-dimensional subspaces contained in Q such that ever...
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...
A set L of linear polynomials in variables X<SUB>1</SUB>,X<SUB>2</SUB>,...,X<SUB>n</SUB> with real c...
A set L of linear polynomials in variables X 1 ; X 2 ; : : : ; X n with real coefficients is said t...
Note that the vertices of the $n$-dimensional cube $\{0, 1\}^n$ can be covered by two affine hyperpl...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover {0,1}n∖{0} without co...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover {0,1}n∖{0} without co...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover without covering 0 i...
AbstractLet G be a simple graph of order n and size m. An edge covering of the graph G is a set of e...
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) to...
AbstractOne can easily cover the vertices of the n-cube by 2 hyperplanes. Here it is proved that any...
AbstractOne can easily cover the vertices of the n-cube by 2 hyperplanes. Here it is proved that any...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
AbstractWe consider coverings of the Boolean n-cube Bn={0,1}n by families of its subsets of the spec...
AbstractA t-cover of a quadric Q is a set C of t-dimensional subspaces contained in Q such that ever...
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...
A set L of linear polynomials in variables X<SUB>1</SUB>,X<SUB>2</SUB>,...,X<SUB>n</SUB> with real c...
A set L of linear polynomials in variables X 1 ; X 2 ; : : : ; X n with real coefficients is said t...
Note that the vertices of the $n$-dimensional cube $\{0, 1\}^n$ can be covered by two affine hyperpl...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover {0,1}n∖{0} without co...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover {0,1}n∖{0} without co...
Alon and Füredi (1993) showed that the number of hyperplanes required to cover without covering 0 i...
AbstractLet G be a simple graph of order n and size m. An edge covering of the graph G is a set of e...
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) to...
AbstractOne can easily cover the vertices of the n-cube by 2 hyperplanes. Here it is proved that any...
AbstractOne can easily cover the vertices of the n-cube by 2 hyperplanes. Here it is proved that any...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
AbstractWe consider coverings of the Boolean n-cube Bn={0,1}n by families of its subsets of the spec...
AbstractA t-cover of a quadric Q is a set C of t-dimensional subspaces contained in Q such that ever...
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...