Derrick Stolee, Assistant Professor
Department of Mathematics
Department of Computer Science
Iowa State University
Data

Ramsey numbers for partially-ordered sets

The following includes a Sage worksheet that generates SMT2 files that can be run using Z3.

• bramsey-smt2.sws is a Sage worksheet that generates SMT2 files for the satisfiability problem concerning 2-color Boolean Ramsey numbers.
• br1-sat-files.zip contains SMT2 files for 1-uniform Boolean Ramsey numbers. Warning: Large! This 50MB .zip file unpacks to multiple GB.
• br2-sat-files.zip contains SMT2 files for 2-uniform Boolean Ramsey numbers. Warning: Large! This 125MB .zip file unpacks to multiple GB.

ADAGE on Grids

• grid-constraint-timing.txt contains the computation times for grid-constraints.exe.
  • Output from grid-constraints.exe is available by request, since the files are very large.
• grid-lp.zip contains LP files for the linear programs (Warning: Large!).
• grid-lp-out.zip contains the output from running the linear programs.

Rainbow Arithmetic Progressions (with S. Butler, C. Erickson, L. Hogben, K. Hogenson, L. Kramer, R. L. Kramer, J. C.-H. Lin, R. R. Martin, N. Warnberg, and M. Young)

• rainbowapdata.zip contains complete output files for runs of the above software.
• rainbowaps_all_values.txt contains all output information from the computational experiments.
• For information regarding computations of $\operatorname{aw}([n],k)$, see
  • rainbowaps_k3_examples.txt (Extremal examples for $k = 3$)
  • rainbowaps_k3_times.txt (Computation times for $k=3$)
  • rainbowaps_allk_examples.txt (Extremal examples for all $k$)
  • rainbowaps_allk_times.txt (Computation times for all $k$).
• For information regarding computations of $\operatorname{aw}({\mathbb Z}_n,k)$, see
  • rainbowaps_zn_k3_examples.txt (Extremal examples for $k = 3$)
  • rainbowaps_zn_k3_times.txt (Computation times for $k=3$)
  • rainbowaps_zn_allk_examples.txt (Extremal examples for all $k$)
  • rainbowaps_zn_allk_times.txt (Computation times for all $k$).

On the independence ratio of distance graphs (with James S. Carraher, David Galvin, Stephen G. Hartke, and A. J. Radcliffe)

• The distance_cliquer software computes the independence ratio of a distance graph, given the set $S$.
• Table of Independence Ratios.
• alldalphas.txt contains all values of computed upper and lower bounds on $\overline{\alpha}(S)$.
• g3.txt contains all data for generator sets of size 3.
• g4.txt contains all data for generator sets of size 4. (WARNING: Large!)
• g5.txt contains all data for generator sets of size 5. (WARNING: Large!)
• allstats.txt contains all data for computed generator sets. (WARNING: Very Large!)

A Linear Programming Approach to the Manickam-Miklós-Singhi Conjecture (with Stephen G. Hartke)

• MMSConjecture Software, User Guide. (Requires Utilities, TreeSearch, and at least one of GLPK and CPLEX.)
• Data values in Excel format
• Data values in CSV files:
  • Values of $g(n,k)$ and sharp examples
  • Values of $g_s(n,k)$ and strong examples

Uniquely $K_r$-Saturated Graphs (with Stephen G. Hartke).

• Saturation Software, User Guide. (Requires Utilities, TreeSearch, nauty, and cliquer)
• Sporadic Graphs in graph6 and adjacency matrix forms.
• Cayley Complements in graph6 form.