scientific article; zbMATH DE number 3609704
From MaRDI portal
Publication:4175585
zbMath0393.05031MaRDI QIDQ4175585
Endre Szemerédi, Imre Z. Ruzsa
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques, The length of an s-increasing sequence of r-tuples, Removal lemmas and approximate homomorphisms, Polynomial removal lemmas for ordered graphs, Simple analysis of graph tests for linearity and PCP, Separating Hash Families: A Johnson-type bound and New Constructions, Unnamed Item, Generalizations of Fourier analysis, and how to apply them, Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$, Mantel's theorem for random graphs, The number of the maximal triangle-free graphs, New applications of the polynomial method: The cap set conjecture and beyond, Efficient Removal Lemmas for Matrices, Testing Linear-Invariant Properties, Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols, Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity, On 3‐graphs with no four vertices spanning exactly two edges, Generalized Turán results for intersecting cliques, Hypergraph regularity and random sampling, Counting hypergraphs with large girth, Minimum degree and the graph removal lemma, Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor, Improved lower bounds for multiplicative square-free sequences, Extremal independent set reconfiguration, Book free 3-uniform hypergraphs, Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points, The minimum degree removal lemma thresholds, On \(3\)-uniform hypergraphs avoiding a cycle of length four, Local-vs-global combinatorics, Additive structure in convex translates, Easily Testable Graph Properties, The (7, 4)-Conjecture in Finite Groups, Asymptotic Structure of Graphs with the Minimum Number of Triangles, Some exact results of the generalized Turán numbers for paths, Sparse Hypergraphs with Applications to Coding Theory, Counting configuration-free sets in groups, Efficient Testing without Efficient Regularity, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A sparse regular approximation lemma, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, Kneser graphs are like Swiss cheese, An analytic approach to sparse hypergraphs: hypergraph removal, A variant of the Corners theorem, Constructing dense grid-free linear $3$-graphs, Green’s Conjecture and Testing Linear Invariant Properties, Unnamed Item, Testability and repair of hereditary hypergraph properties, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, What is good mathematics?, A new proof of Roth’s theorem on arithmetic progressions, Many \(T\) copies in \(H\)-free graphs, Triforce and corners, Proof of the Brown–Erdős–Sós conjecture in groups, Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees, Large girth approximate Steiner triple systems, Asymptotic Structure for the Clique Density Theorem, The Induced Removal Lemma in Sparse Graphs, Unnamed Item, Triple systems with no three triples spanning at most five points, Supersaturation of even linear cycles in linear hypergraphs, Erdös--Pósa Property for Labeled Minors: 2-Connected Minors, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Estimating parameters associated with monotone properties, A note on the Brown–Erdős–Sós conjecture in groups, Independent sets in hypergraphs, New Results on Linear Size Distance Preservers, Unnamed Item, Ramsey Numbers for Nontrivial Berge Cycles, A Ramsey variant of the Brown–Erdős–Sós conjecture, The regularity method for graphs with few 4‐cycles, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, The exact linear Turán number of the sail, Additive combinatorics and graph theory, Testing graphs against an unknown distribution, On subsets of abelian groups with no 3-term arithmetic progression, A characterization of easily testable induced digraphs and \(k\)-colored graphs, On ordered Ramsey numbers of bounded-degree graphs, The spectral radius of graphs with no intersecting odd cycles, Induced arithmetic removal: complexity 1 patterns over finite fields, Multicolor Turán numbers, Short proofs of some extremal results. II., Online containers for hypergraphs, with applications to linear equations, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, A variant of the hypergraph removal lemma, Small cores in 3-uniform hypergraphs, Exact solution of some Turán-type problems, The linear Turán number of small triple systems or why is the wicket interesting?, A unique characterization of spectral extrema for friendship graphs, Saturating Sperner families, On the maximum number of integer colourings with forbidden monochromatic sums, On the density of a graph and its blowup, Large joints in graphs, Color the cycles, 3-uniform hypergraphs without a cycle of length five, Efficient removal lemmas for matrices, Bounds for graph regularity and removal lemmas, Maximal independent sets in clique-free graphs, On regular hypergraphs of high girth, The removal lemma for tournaments, Unavoidable tournaments, The fine structure of octahedron-free graphs, Diameter critical graphs, A new proof of the graph removal lemma, Triangles in graphs without bipartite suspensions, Maximal antichains of minimum size, The maximum spectral radius of graphs without friendship subgraphs, Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs, Average Gromov hyperbolicity and the Parisi ansatz, The homomorphism domination exponent, Extremal results in sparse pseudorandom graphs, On a conjecture of Erdős on locally sparse Steiner triple systems, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, On possible Turán densities, On a problem of Erdős and Rothschild on edges in triangles, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Colorings with only rainbow arithmetic progressions, Sparse hypergraphs: new bounds and constructions, Turán and Ramsey numbers in linear triple systems, Turán problems and shadows. I: Paths and cycles, A counterexample to sparse removal, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, Multiple recurrence in quasirandom groups, On the KŁR conjecture in random graphs, The domination number of the graph defined by two levels of the \(n\)-cube. II, A linear hypergraph extension of the bipartite Turán problem, The strong chromatic index of sparse graphs, The joints problem for matroids, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Comparable pairs in families of sets, More Turán-type theorems for triangles in convex point sets, Saturated \(r\)-uniform hypergraphs, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), Turán number of special four cycles in triple systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, The spectral radius of graphs with no odd wheels, Linear Turán numbers of acyclic triple systems, The critical window for the classical Ramsey-Turán problem, The sum of nonsingular matrices is often nonsingular, Unavoidable patterns, The Gaussian primes contain arbitrarily shaped constellations, A removal lemma for systems of linear equations over finite fields, Partitioning ordered hypergraphs, Extremal Betti numbers of Vietoris-Rips complexes, The domination number of the graph defined by two levels of the \(n\)-cube, Roth-type theorems in finite groups, Relative Turán numbers for hypergraph cycles, Hypergraphs without exponents, Spectral extremal results for hypergraphs, Arithmetic progressions, different regularity lemmas and removal lemmas, Triangle-free subgraphs of hypergraphs, Degenerate Turán densities of sparse hypergraphs, The Brown-Erdős-Sós conjecture in finite abelian groups, A combinatorial proof of the removal lemma for groups, Minimum number of edges that occur in odd cycles, Small stopping sets in Steiner triple systems, The asymptotic induced matching number of hypergraphs: balanced binary strings, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, On 0-1 matrices and small excluded submatrices, Generalized Turán problems for complete bipartite graphs, On the existence of dense substructures in finite groups, A tight bound for hypergraph regularity, Induced subgraphs of given sizes, Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs, Turán and Ramsey numbers in linear triple systems. II, A new bound for the Brown-Erdős-Sós problem, Turán numbers and batch codes, A linear hypergraph extension of Turán's theorem, The Erdős-Ko-Rado theorem for small families, On the algebraic and topological structure of the set of Turán densities, A relative Szemerédi theorem
