This page contains computer assisted parts of the paper Weighted Turán problems, with applications to Ramsey-Turán questions.
A preliminary version of the paper can be downloaded here or from arXiv.
Here, you can download the technical things (certificates for flag algebra calculations) as one archive. Note that some of the calculations are slightly intense and it is not possible to run them on a office desktop. At least 128GB of memory may be necessary.
Dependencies
Description of the content of anc_weighted.zip
check.sh ... performs check of presented certifcates. Only SageMath is needed.
recalculate.sh ... script performing the entire calculation
claim_* ... directory containing certificate for claim *
F_??__nX_labeled.txt ... List of labeled flags on X vertices
F_??__nX_unlabeled.txt ... List of unlabeled flags on X vertices
F_??__objective.txt ... objective function for min or max program
SDP_nX_?B_.txt.dat-s ... semidefinite program
SDP_nX_?B_.txt.dat-s.result ... semidefinite program - numerical solution by csdp
altered*.. ... projection of semidefinite program
rounding_exact.sage ... sage script for exact roundig
round.sage ... performing rounding (making certificate)
round.sage.log ... output when running round.sage
check.sage ... tests the rounding (certificate)
extender.py ... creating the list of forbidden weighted cliques
to_extend??.txt ... basic patterns of forbidden cliques
*.slurm ... script for using supercomputer
*.log ... output when running the script