of convex sets Φk , each containing Φ.
Statement
of convex sets Φk , each containing Φ. Moreover, with appropriate control, opti- mization over the relaxations Φk can be carried out efficiently, for instance via semidefinite programming. This allows us to compute upper bounds for ex(C, H). Many significant results in extremal combinatorics have been obtained via the theory of flag algebras, for instance: computing the minimal number of triangles in graphs with given density, computing the maximum number of pentagons in triangle-free graphs, and obtaining new results regarding the Cacceta-Häggkvist conjecture (see Carli Silva, Oliveira, and Sato [1] for references). Though presented here in the context of graphs, the theory is more general, and can be applied also to digraphs, permutations, and other objects. Conic Linear Optimization for Computer-Assisted Proofs 1071
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.