Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

József Balogh, Ping Hu, Bernard Lidický, Hong Liu

This page is containing computer assisted parts of the paper titled Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube.

You can download the technical things as

You get the following:

The semidefinite program is in SDPA format.

The spanning subgraphs of Q3 are given as {0,1}12 characteristic vectors of 12 edges ordered in the lexicographic order.

Notes: