Documentation

FormalConjectures.Wikipedia.SnakeInTheBox

Snake in the box #

References:

A graph on the power set of Fin n, where two sets are adjacent if their intersection has size 1.

Equations
Instances For

    A subgraph G' is a 'snake' of length k in graph G if it is an induced path of length k.

    Equations
    Instances For
      noncomputable def SnakeInBox.LongestSnakeInGraph {V : Type u} [DecidableEq V] (G : SimpleGraph V) :

      The length of the longest induced path (or 'snake') in a graph G.

      Equations
      Instances For
        noncomputable def SnakeInBox.LongestSnakeInTheBox (n : ) :

        The length of the longest snake for the Hypercube n graph.

        Equations
        Instances For

          The longest snake in the $0$-dimensional cube, i.e. the cube consisting of one point, is zero, since there only is one induced path and it is of length zero.

          theorem SnakeInBox.snake_upper_bound (n : ) :
          (LongestSnakeInTheBox n) 1 + 2 ^ (n - 1) * (6 * n) / (6 * n + 1 / (6 * 6) * n)

          An upper bound of the maximal length of the longest snake in a box is given by $$ 1 + 2^{n-1}\frac{6n}{6n + \frac{1}{6\sqrt{6}}n^{\frac 1 2} - 7}. $$