A measure-theoretic approach to the theory of dense hypergraphs
From MaRDI portal
Publication:456779
DOI10.1016/j.aim.2012.06.022zbMath1251.05115arXiv0810.4062OpenAlexW2061886541MaRDI QIDQ456779
Publication date: 16 October 2012
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.4062
Related Items
Cut distance identifying graphon parameters over weak* limits ⋮ A problem of Erdős and Sós on 3-graphs ⋮ Random Simplicial Complexes: Models and Phenomena ⋮ First order convergence of matroids ⋮ On replica symmetry of large deviations in random graphs ⋮ Hypergraph limits: A regularity approach ⋮ Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds ⋮ Uniqueness of Banach space valued graphons ⋮ Limits of functions on groups ⋮ Concentration function for pyramid and quantum metric measure space ⋮ An uncountable ergodic Roth theorem and applications ⋮ σ-algebras for quasirandom hypergraphs ⋮ Concentration estimates for functions of finite high‐dimensional random arrays ⋮ Convergence and limits of finite trees ⋮ Natural quasirandomness properties ⋮ Graph limits and hereditary properties ⋮ Continuous stable regularity ⋮ Restricted problems in extremal combinatorics ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ Correcting continuous hypergraphs ⋮ Quasi-random graphs and graph limits ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Limits of kernel operators and the spectral regularity lemma ⋮ The inducibility of blow-up graphs ⋮ On possible Turán densities ⋮ Relating the cut distance and the weak* topology for graphons ⋮ Semantic limits of dense combinatorial objects ⋮ Multiple recurrence in quasirandom groups ⋮ Limits of locally-globally convergent graph sequences ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ An analytic approach to stability ⋮ Triforce and corners ⋮ Arithmetic progressions, different regularity lemmas and removal lemmas ⋮ Examples in the entropy theory of countable group actions ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Poset limits can be totally ordered ⋮ A tight bound for hypergraph regularity ⋮ Structural Properties of Sparse Graphs ⋮ Unnamed Item ⋮ Differential calculus on graphon space ⋮ Weighted Quasi-Arithmetic Mean on Two-Dimensional Regions and Their Applications
Cites Work
- Unnamed Item
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Generalizations of the removal lemma
- Model theory.
- Symmetries on random arrays and set-indexed processes
- Moments of two-variable functions and the uniqueness of graph limits
- Graph limits and parameter testing
- Testability and repair of hereditary hypergraph properties
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Conversion from Nonstandard to Standard Measure Spaces and Applications in Probability Theory
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- On Homogeneous Measure Algebras
