scientific article; zbMATH DE number 3609704
From MaRDI portal
Publication:4175585
zbMATH Open0393.05031MaRDI QIDQ4175585FDOQ4175585
Authors: Imre Z. Ruzsa, Endre Szemerédi 
Publication date: 1978
Title of this publication is not available (Why is that?)
Recommendations
- Triple systems with no three triples spanning at most five points
- scientific article; zbMATH DE number 1501963
- scientific article; zbMATH DE number 1472201
- Triple Systems Not Containing a Fano Configuration
- Almost all triangle-free triple systems are tripartite
- The number of triple systems without even cycles
- scientific article; zbMATH DE number 3995698
- Set systems without a 3-simplex
- Two constructions for perfect hexagon triple systems
Cited In (only showing first 100 items - show all)
- On the existence of dense substructures in finite groups
- Multiple recurrence in quasirandom groups
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- More Turán-type theorems for triangles in convex point sets
- Extremal Betti numbers of Vietoris-Rips complexes
- The number of the maximal triangle-free graphs
- Unavoidable tournaments
- Testability and repair of hereditary hypergraph properties
- A new proof of Roth’s theorem on arithmetic progressions
- Independent sets in hypergraphs
- Mantel's theorem for random graphs
- The strong chromatic index of sparse graphs
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- Induced subgraphs of given sizes
- A linear hypergraph extension of Turán's theorem
- A linear hypergraph extension of the bipartite Turán problem
- Saturated \(r\)-uniform hypergraphs
- On the algebraic and topological structure of the set of Turán densities
- On possible Turán densities
- 3-uniform hypergraphs without a cycle of length five
- Simple analysis of graph tests for linearity and PCP
- The fine structure of octahedron-free graphs
- Minimum number of edges that occur in odd cycles
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- On the density of a graph and its blowup
- Large joints in graphs
- Exact solution of some Turán-type problems
- A tight bound for hypergraph regularity
- Turán problems and shadows. I: Paths and cycles
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Online containers for hypergraphs, with applications to linear equations
- Short proofs of some extremal results. II.
- Roth-type theorems in finite groups
- The homomorphism domination exponent
- A relative Szemerédi theorem
- Asymptotic Structure for the Clique Density Theorem
- A counterexample to sparse removal
- Separating hash families: a Johnson-type bound and new constructions
- A variant of the hypergraph removal lemma
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- A new proof of the graph removal lemma
- On 0-1 matrices and small excluded submatrices
- The joints problem for matroids
- Extremal results in sparse pseudorandom graphs
- Partitioning ordered hypergraphs
- Small cores in 3-uniform hypergraphs
- Unavoidable patterns
- The (7, 4)-Conjecture in Finite Groups
- On regular hypergraphs of high girth
- The Erdős-Ko-Rado theorem for small families
- A combinatorial proof of the removal lemma for groups
- Set systems without a 3-simplex
- Comparable pairs in families of sets
- On the KŁR conjecture in random graphs
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- The Gaussian primes contain arbitrarily shaped constellations
- A removal lemma for systems of linear equations over finite fields
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Saturating Sperner families
- What is good mathematics?
- Bounds for graph regularity and removal lemmas
- The critical window for the classical Ramsey-Turán problem
- The Brown-Erdős-Sós conjecture in finite abelian groups
- Color the cycles
- Asymptotic structure of graphs with the minimum number of triangles
- Diameter critical graphs
- On ordered Ramsey numbers of bounded-degree graphs
- Sparse hypergraphs: new bounds and constructions
- The length of an s-increasing sequence of r-tuples
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- Many \(T\) copies in \(H\)-free graphs
- On subsets of abelian groups with no 3-term arithmetic progression
- Triforce and corners
- A variant of the Corners theorem
- Hypergraph regularity and random sampling
- Turán number of special four cycles in triple systems
- Sparse hypergraphs with applications to coding theory
- Regular decomposition of the edge set of a graph with applications
- Efficient testing without efficient regularity
- The domination number of the graph defined by two levels of the \(n\)-cube. II
- Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\)
- Estimating parameters associated with monotone properties
- On multicolor Turán numbers
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
- The induced removal lemma in sparse graphs
- Supersaturation of even linear cycles in linear hypergraphs
- Testing odd-cycle-freeness in Boolean functions
- Book free 3-uniform hypergraphs
- Generalized Turán results for intersecting cliques
- Counting configuration-free sets in groups
- New results on linear size distance preservers
- Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices
- On the structure of pointsets with many collinear triples
- A sparse regular approximation lemma
- Polynomial removal lemma for ordered matchings
- The minimum degree removal lemma thresholds
- On \(3\)-uniform hypergraphs avoiding a cycle of length four
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175585)
