ExactDensityBounder.cpp: An easier to use version of DensityBounder which can make approximate results exact. The program determines an upper bound for Turan densities of 3-uniform hypergraphs. It creates an SDP problem to determine the bound. The SDP problem is then solved by third party SDP solvers (such as csdp or sdpa). The program then removes rounding errors and outputs the details into a ”.txt” file that can be verified by the program DensityChecker. This source code has not been written so that it is easy to understand (instead see the source code for DensityBounder which is a bit more readable).

References in zbMATH (referenced in 2 articles )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Baber, Rahil; Talbot, John: New Turán densities for 3-graphs (2012)
  2. Baber, Rahil; Talbot, John: Hypergraphs do jump (2011)