Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T01:15:55.723Z Has data issue: false hasContentIssue false

Flag algebras

Published online by Cambridge University Press:  12 March 2014

Alexander A. Razborov*
Affiliation:
School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA. E-mail: Mrazborov@math.ias.eduSteklov Mathematical Institute, Moscow, Russia. E-mail: Mrazborov@math.ias.edu

Abstract

Asymptotic extremal combinatorics deals with questions that in the language of model theory can be re-stated as follows. For finite models M, N of an universal theory without constants and function symbols (like graphs, digraphs or hypergraphs), let p(M, N) be the probability that a randomly chosen sub-model of N with ∣M∣ elements is isomorphic to M. Which asymptotic relations exist between the quantities p(M1,N),…, p(Mh,N), where M1,…, M1, are fixed “template” models and ∣N∣ grows to infinity?

In this paper we develop a formal calculus that captures many standard arguments in the area, both previously known and apparently new. We give the first application of this formalism by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable