scientific article; zbMATH DE number 19183
[For the entire collection see Zbl 0734.00014.] The following conjecture has been given in this paper: `If \(N\) is a power of 2, then \(g(N-1)\leq(N-1)(N-2)/4\) and \(f(N)\geq(1/2+3/2N-2/N^ 2)\cdot N\cdot 2^{N-1}\),' where \(H(n)\) is the (undirected) graph formed by the vertices and edges of the \(n\)-dimensional cube \([0,1]^ n\); \(f(n)\) is the least integer such that every subgraph of \(H(n)\) with at least \(f(n)\) edges contains a square; and \(g(n)=\min\{| E'|/| V'|:\) \(E'\) is a square-blocking edge subset in \(H(n)\) avoiding a vertex subset \(V'\}\). The validity of this conjecture has been established for \(N=7\) using the perfect Hamming code in \(H(N)\) and an assignment of orientation to the associated Steiner triple system.
- Bounding the size of square-free subgraphs of the hypercube
- On symmetric subgraphs of the 7-cube: An overview
- A special case of set covering problems
- On the maximum number of edges in a c4‐free subgraph of qn
- Links between two semisymmetric graphs on 112 vertices via association schemes
- On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
- Highly symmetric subgraphs of hypercubes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976612)