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:cubes_1.cpp
and cubes_2.cpp
doing the same thing
graphs_1_C4-free.txt, graphs_2_C4-free.txt
)
graphs_1_C6-free.txt, graphs_2_C6-free.txt
)
sdp_1_C4_input.txt, sdp_2_C4_input.txt
)
sdp_1_C6_input.txt, sdp_2_C6_input.txt
)
sdp_X_CY_solution.txt
)
*.m
)
Makefile
for convenience
The semidefinite program is in SDPA format.
The spanning subgraphs of Q_{3} are given as {0,1}^{12} characteristic vectors of 12 edges ordered in the lexicographic order.
Notes: