Pages that link to "Item:Q926374"
From MaRDI portal
The following pages link to A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374):
Displaying 17 items.
- A new proof of the density Hales-Jewett theorem (Q431641) (← links)
- Non-conventional ergodic averages for several commuting actions of an amenable group (Q518566) (← links)
- Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma (Q628350) (← links)
- Deducing the density Hales-Jewett theorem from an infinitary removal lemma (Q639342) (← links)
- Graph limits and hereditary properties (Q896080) (← links)
- An approximate logic for measures (Q2017144) (← links)
- Poset limits and exchangeable random posets (Q2428630) (← links)
- An application of proof mining to nonlinear iterations (Q2453072) (← links)
- Multiple recurrence in quasirandom groups (Q2453444) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Lower bound in the Roth theorem for amenable groups (Q2942566) (← links)
- <i>σ</i>-algebras for quasirandom hypergraphs (Q2951886) (← links)
- Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Hypergraph limits: A regularity approach (Q3192379) (← links)
- An analytic approach to sparse hypergraphs: hypergraph removal (Q4645028) (← links)
- Poset limits can be totally ordered (Q5247001) (← links)
