paper

A Generalization of the Methods of Brass, Harboth, and Nieborg

arXiv:1405.5957

Abstract

In 1995, Brass, Harborth and Nienborg disproved a conjecture of Erdős when they showed that a -free subgraph of the hypercube, , can have at least edges. In this paper, we generalize the idea of Brass, Harborth and Nienborg to provide good constructions of -free subgraphs of for some small values of .