Our main tool is `Flagmatic’, an implementation of Razborov’s semi-definite method, which we are making publicly available. In a bid to make the power of Razborov’s method more widely accessible, we have tried to make Flagmatic as user-friendly as possible, hoping to remove thereby the major hurdle that needs to be cleared before using the semi-definite method. Finally, we spend some time reflecting on the limitations of our approach, and in particular on which problems we may be unable to solve. Our discussion of the `complexity barrier’ for the semi-definite method may be of general interest
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Grzesik, Andrzej: On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament (2017)
- Even-Zohar, Chaim; Linial, Nati: A note on the inducibility of 4-vertex graphs (2015)
- Falgas-Ravry, Victor; Marchant, Edward; Pikhurko, Oleg; Vaughan, Emil R.: The codegree threshold for 3-graphs with independent neighborhoods (2015)
- Falgas-Ravry, Victor; Vaughan, Emil R.: Applications of the semi-definite method to the Turán density problem for 3-graphs (2013)