Pages that link to "Item:Q4810506"

The following pages link to Regularity Lemma for k-uniform hypergraphs (Q4810506):

Displaying 50 items.

• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
• The Gaussian primes contain arbitrarily shaped constellations (Q2479612) (← links)
• Roth-type theorems in finite groups (Q2509729) (← links)
• Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• <i>σ</i>-algebras for quasirandom hypergraphs (Q2951886) (← links)
• Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
• A hypergraph blow-up lemma (Q3094607) (← links)
• Weak quasi-randomness for uniform hypergraphs (Q3119042) (← links)
• The quasi-randomness of hypergraph cut properties (Q3119045) (← links)
• Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
• Generalizations of Fourier analysis, and how to apply them (Q3178746) (← links)
• On replica symmetry of large deviations in random graphs (Q3192375) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• A hypergraph regularity method for generalized Turán problems (Q3608316) (← links)
• Regularity lemmas for hypergraphs and quasi-randomness (Q3978309) (← links)
• Regularity properties for triple systems (Q4431435) (← links)
• An algorithmic hypergraph regularity lemma (Q4564860) (← links)
• A sparse regular approximation lemma (Q4633762) (← links)
• An analytic approach to sparse hypergraphs: hypergraph removal (Q4645028) (← links)
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs (Q4667862) (← links)
• Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
• Green’s Conjecture and Testing Linear Invariant Properties (Q4933388) (← links)
• Efficient Removal Lemmas for Matrices (Q5002628) (← links)
• Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
• The symmetry preserving removal lemma (Q5189164) (← links)
• Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (Q5237911) (← links)
• The poset of hypergraph quasirandomness (Q5265346) (← links)
• An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
• The (7, 4)-Conjecture in Finite Groups (Q5364251) (← links)
• On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
• The hypergraph regularity method and its applications (Q5385859) (← links)
• Constructive Packings by Linear Hypergraphs (Q5397735) (← links)
• An arithmetic transference proof of a relative Szemerédi theorem (Q5408700) (← links)
• What is good mathematics? (Q5452356) (← links)
• The counting lemma for regular <i>k</i>‐uniform hypergraphs (Q5469145) (← links)
• Applications of the regularity lemma for uniform hypergraphs (Q5469146) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• From harmonic analysis to arithmetic combinatorics (Q5503659) (← links)
• (Q5743465) (← links)
• A blurred view of Van der Waerden type theorems (Q5886338) (← links)
• Regularity lemmas in a Banach space setting (Q5890899) (← links)
• Ramsey numbers of sparse hypergraphs (Q5893929) (← links)
• Graph norms and Sidorenko's conjecture (Q5962247) (← links)
• On 3‐graphs with no four vertices spanning exactly two edges (Q6051388) (← links)
• SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT (Q6051422) (← links)
• Quasirandom-Forcing Orientations of Cycles (Q6071821) (← links)
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← links)
• Hypergraph regularity and random sampling (Q6076218) (← links)