Semantic limits of dense combinatorial objects

DOI10.1070/RM9956zbMath1498.03068arXiv1910.08797MaRDI QIDQ5138464

Leonardo Nagami Coregliano, Alexander A. Razborov

Publication date: 3 December 2020

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.08797

zbMATH Keywords

model theoryextremal combinatoricsgraph limitsflag algebrasexchangeable arrays

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Model theory of finite structures (03C13) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Models of other mathematical theories (03C65)

Related Items (5)

On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ Concentration estimates for functions of finite high‐dimensional random arrays ⋮ Natural quasirandomness properties ⋮ First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees ⋮ The Cut Metric for Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• Limits of Boolean functions on \(\mathbb{F}_p^n\)
• Quasi-random graphs and graph limits
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Generalizations of the removal lemma
• Representations for partially exchangeable arrays of random variables
• On the statistics of vision: The Julesz conjecture
• Method for construction of (3,4)-graphs
• Symmetries on random arrays and set-indexed processes
• Model theory
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Classification of measurable functions of several variables and invariantly distributed random matrices
• Limits of permutation sequences
• Interval graph limits
• Finitely forcible graphons
• Rainbow triangles in three-colored graphs
• Poset limits and exchangeable random posets
• Forbidden paths and cycles in ordered graphs and matrices
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
• Nonlinear large deviations
• Undecidable theories
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Uncountable graphs and invariant measures on the set of universal countable graphs
• Testability and repair of hereditary hypergraph properties
• Quasi-random tournaments
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Threshold Graph Limits and Random Threshold Graphs
• Graph limits and exchangeable random graphs
• Metrics for sparse graphs
• Gowers Norm, Function Limits, and Parameter Estimation
• EXTREMAL THEORY OF ORDERED GRAPHS
• Sparse graphs: Metrics and random models
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Poset limits can be totally ordered
• Undecidability of linear inequalities in graph homomorphism densities
• Regularity lemmas for stable graphs
• Flag algebras
• The random graph
• Probabilistic Symmetries and Invariance Principles
• INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
• Quasi-random graphs

This page was built for publication: Semantic limits of dense combinatorial objects