pith. sign in

arxiv: 1607.04741 · v1 · pith:S3YG2QFBnew · submitted 2016-07-16 · 🧮 math.CO · math.OC

Flag Algebras: A First Glance

Marcel K. de Carli Silva , Fernando M\'ario de Oliveira Filho , Cristiane Maria Sato This is my paper
classification 🧮 math.CO math.OC
keywords algebrascombinatoricsextremalflagtheoryapproacharticlebounds
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Balanced bipartite distance of $K_4$-free graphs

    math.CO 2026-05 accept novelty 7.0

    Every K4-free graph on n vertices has balanced bipartite distance at most n²/9.