Flagmatic

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


References in zbMATH (referenced in 22 articles )

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

1 2 next

  1. Choi, Ilkyoo; Lidický, Bernard; Pfender, Florian: Inducibility of directed paths (2020)
  2. Bárány, Imre; Füredi, Zoltán: Almost similar configurations (2019)
  3. Grzesik, Andrzej; Hu, Ping; Volec, Jan: Minimum number of edges that occur in odd cycles (2019)
  4. Pikhurko, Oleg; Sliačan, Jakub; Tyros, Konstantinos: Strong forms of stability from flag algebra calculations (2019)
  5. Yuster, Raphael: On the exact maximum induced density of almost all graphs and their inducibility (2019)
  6. Lidický, Bernard; Pfender, Florian: Pentagons in triangle-free graphs (2018)
  7. Raymond, Annie; Saunderson, James; Singh, Mohit; Thomas, Rekha R.: Symmetric sums of squares over (k)-subset hypercubes (2018)
  8. Raymond, Annie; Singh, Mohit; Thomas, Rekha R.: Symmetry in Turán sums of squares polynomials from flag algebras (2018)
  9. Falgas-Ravry, Victor; Pikhurko, Oleg; Vaughan, Emil; Volec, Jan: The codegree threshold of (K_4^-) (2017)
  10. Gethner, Ellen; Hogben, Leslie; Lidický, Bernard; Pfender, Florian; Ruiz, Amanda; Young, Michael: On crossing numbers of complete tripartite and balanced complete multipartite graphs (2017)
  11. Grzesik, Andrzej: On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament (2017)
  12. Alon, Noga; Naves, Humberto; Sudakov, Benny: On the maximum quartet distance between phylogenetic trees (2016)
  13. Balogh, József; Hu, Ping; Lidický, Bernard; Pfender, Florian: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (2016)
  14. Glebov, Roman; Král’, Daniel; Volec, Jan: A problem of Erdős and Sós on 3-graphs (2016)
  15. Grosu, Codruţ: On the algebraic and topological structure of the set of Turán densities (2016)
  16. Hefetz, Dan; Tyomkyn, Mykhaylo: Universality of graphs with few triangles and anti-triangles (2016)
  17. Balogh, József; Hu, Ping; Lidický, Bernard; Pikhurko, Oleg; Udvari, Balázs; Vplec, Jan: Minimum number of monotone subsequences of length 4 in permutations (2015)
  18. Even-Zohar, Chaim; Linial, Nati: A note on the inducibility of 4-vertex graphs (2015)
  19. Falgas-Ravry, Victor; Marchant, Edward; Pikhurko, Oleg; Vaughan, Emil R.: The codegree threshold for 3-graphs with independent neighborhoods (2015)
  20. Pikhurko, Oleg: On possible Turán densities (2014)

1 2 next