The following pages link to Balázs Szegedy (Q233550):
Displaying 50 items.
- (Q321161) (redirect page) (← links)
- Borel liftings of graph limits (Q321162) (← links)
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
- A measure-theoretic approach to the theory of dense hypergraphs (Q456779) (← links)
- The automorphism group of a graphon (Q468695) (← links)
- On finite groups whose derived subgroup has bounded rank. (Q607825) (← links)
- Testing properties of graphs and functions (Q607829) (← links)
- Limits of kernel operators and the spectral regularity lemma (Q648972) (← links)
- Coverings of Abelian groups and vector spaces. (Q857412) (← links)
- Symplectic spaces and ear-decomposition of matroids (Q858119) (← links)
- Limits of dense graph sequences (Q859618) (← links)
- Tilings of the square with similar right triangles (Q873652) (← links)
- Szemerédi's lemma for the analyst (Q879618) (← links)
- On the characters of the group of upper-triangular matrices (Q1125878) (← links)
- Congruence subgroup growth of arithmetic groups in positive characteristic. (Q1394592) (← links)
- Characters of the Borel and Sylow subgroups of classical groups (Q1403894) (← links)
- A continuous model for systems of complexity 2 on simple abelian groups (Q1661514) (← links)
- Multigraph limits, unbounded kernels, and Banach space decorated graphs (Q2056409) (← links)
- Typicality and entropy of processes on infinite trees (Q2083861) (← links)
- Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds (Q2164375) (← links)
- Finitely forcible graphons (Q2275893) (← links)
- Measures on the square as sparse graph limits (Q2312613) (← links)
- On the almost eigenvectors of random regular graphs (Q2421826) (← links)
- Limits of locally-globally convergent graph sequences (Q2453451) (← links)
- A refinement of Cauchy-Schwarz complexity (Q2674565) (← links)
- Random graphons and a weak Positivstellensatz for graphs (Q2888890) (← links)
- Graph limits and parameter testing (Q2931391) (← links)
- (Q3060866) (← links)
- Regularity partitions and the topology of graphons (Q3078210) (← links)
- Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← links)
- Edge coloring models and reflection positivity (Q3594371) (← links)
- Contractors and connectors of graph algebras (Q3605157) (← links)
- Limits of functions on groups (Q4586341) (← links)
- Graph properties, graph limits, and entropy (Q4604027) (← links)
- ALMOST ALL FINITELY GENERATED SUBGROUPS OF THE NOTTINGHAM GROUP ARE FREE (Q4673182) (← links)
- Bounds in groups with finite abelian coverings or with finite derived groups (Q4779668) (← links)
- On large‐girth regular graphs and random processes on trees (Q4961543) (← links)
- On nilspace systems and their morphisms (Q4970740) (← links)
- Action convergence of operators and graphs (Q5029489) (← links)
- FROM GRAPH LIMITS TO HIGHER ORDER FOURIER ANALYSIS (Q5122153) (← links)
- The symmetry preserving removal lemma (Q5189164) (← links)
- Bounds for the index of the centre in capable groups (Q5313322) (← links)
- Transversals of additive Latin squares (Q5957364) (← links)
- On higher-order Fourier analysis in characteristic <i>p</i> (Q6068432) (← links)
- On Sidorenko's conjecture for determinants and Gaussian Markov random fields (Q6074867) (← links)
- Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits (Q6107960) (← links)
- Subgraph densities in Markov spaces (Q6184559) (← links)
- Random homomorphisms into the orthogonality graph (Q6367155) (← links)
- A higher-order generalization of group theory (Q6736030) (← links)
- Spectral algorithms in higher-order Fourier analysis (Q6764050) (← links)
