combinatorics

Local flag algebras

arXiv:2607.12461

summary

The paper introduces local flag algebras, a variant of Razborov's flag algebra method that normalizes graph densities by the maximum degree instead of the number of vertices, and uses it to bound the number of pentagons in triangle‑free graphs.

Abstract

We introduce local flag algebras, a variant of Razborov's flag algebra framework in which densities are normalised by the maximum degree rather than the order . The framework supports the same semidefinite-method machinery as the classical version, but is tailored to extremal problems that scale with the maximum degree. As an illustrative first application we bound the number of pentagons in a triangle-free graph as a function of and .

30 pages, 1 figure

Topics & keywords

#extremal graph theory#flag algebras#maximum degree#triangle‑free graphs#pentagon countinglocal flag algebrassemidefinite programminggraph densitymaximum degree normalizationpentagon bound
Local flag algebras · wovepaper