2000 character limit reached
A Generalization of the Methods of Brass, Harboth, and Nieborg
Published 23 May 2014 in math.CO | (1405.5957v1)
Abstract: In 1995, Brass, Harborth and Nienborg disproved a conjecture of Erd\H{o}s when they showed that a $C_4$-free subgraph of the hypercube, $Q_n$, can have at least $(\frac 12 +\omega(1))e(Q_n)$ edges. In this paper, we generalize the idea of Brass, Harborth and Nienborg to provide good constructions of $Q_3$-free subgraphs of $Q_n$ for some small values of $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.