On problems of Erd s and Baumann-Briggs on minimising the density of s-cliques in graphs with forbidden subgraphs
math.CO
Submitted: 2026-02-19
Updated: 2026-11-01
Code: https://github.com/bodnalev/supplementary_files
Terminology
Sources
- FlagAlgebraToolbox: Flag Algebra Computations in SageMath
- An Introduction to Razborov's Flag Algebra as a Proof System for Extremal Graph Theory
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality