Pages that link to "Item:Q5469145"
From MaRDI portal
The following pages link to The counting lemma for regular <i>k</i>‐uniform hypergraphs (Q5469145):
Displaying 12 items.
- Hypergraph regularity and random sampling (Q6076218) (← links)
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL (Q6156630) (← links)
- Subsets of without L-shaped configurations (Q6181110) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- Quasi-random Boolean functions (Q6574391) (← links)
- On some extremal results for order types (Q6621216) (← links)
- On the threshold for Szemerédi's theorem with random differences (Q6635163) (← links)
- Polynomial removal lemma for ordered matchings (Q6635188) (← links)
- Equivalent regular partitions of three-uniform hypergraphs (Q6641065) (← links)
- Colouring versus density in integers and Hales-Jewett cubes (Q6641568) (← links)
- Induced Turán problem in bipartite graphs (Q6648290) (← links)