No label defined (Q3976612)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 19183
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 19183

      Statements

      26 June 1992
      0 references
      square-blocking edge subsets
      0 references
      hypercubes
      0 references
      vertex avoidance
      0 references
      \(n\)- dimensional cube
      0 references
      Hamming code
      0 references
      Steiner triple system
      0 references
      0 references
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references