Abstract
AbstractAsymptotic 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.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. Lovász L. and Szegedy B. , Limits of dense graph sequences, Technical Report TR-2004-79, Microsoft Research, 08 2004.
2. Supersaturated graphs and hypergraphs
Cited by
156 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Almost Congruent Triangles;Discrete & Computational Geometry;2024-01-11
2. The Cycle of Length Four is Strictly F-Turán-Good;Bulletin of the Malaysian Mathematical Sciences Society;2023-11-08
3. Hypergraphs with minimum positive uniform Turán density;Israel Journal of Mathematics;2023-10-09
4. 10 problems for partitions of triangle-free graphs;European Journal of Combinatorics;2023-10
5. Common graphs with arbitrary connectivity and chromatic number;Journal of Combinatorial Theory, Series B;2023-09