Marcel K. de Carli Silva, Fernando Mário de Oliveira Filho, Cristiane Maria Sato
Published 2016-07-16Version 1
The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in extremal combinatorics with the help of a computer, in a semi-automated manner. This article describes the main points of the theory in a complete way, using Mantel's theorem as a guiding example.
Comments: 13pp., written for Niew Archief voor Wiskunde
Problems and results in Extremal Combinatorics -- IV
An extension of Mantel's theorem to random 4-uniform hypergraphs
Refuting conjectures in extremal combinatorics via linear programming
![QR code for arXiv:1607.04741 [math.CO]](http://oss.arxitics.com/images/favicon.svg)