scientific article; zbMATH DE number 3609704

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)

A combinatorial proof of the removal lemma for groups
Small stopping sets in Steiner triple systems
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
On subsets of abelian groups with no 3-term arithmetic progression
Exact solution of some Turán-type problems
Saturated r-uniform hypergraphs
Induced subgraphs of given sizes
The Erdős-Ko-Rado theorem for small families
Additive combinatorics and graph theory
On ordered Ramsey numbers of bounded-degree graphs
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
The sum of nonsingular matrices is often nonsingular
A removal lemma for systems of linear equations over finite fields
Bounds for graph regularity and removal lemmas
Maximal antichains of minimum size
Partitioning ordered hypergraphs
The domination number of the graph defined by two levels of the \(n\)-cube
Relative Turán numbers for hypergraph cycles
Hypergraphs without exponents
Spectral extremal results for hypergraphs
Triangle-free subgraphs of hypergraphs
Generalized Turán problems for complete bipartite graphs
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
A linear hypergraph extension of Turán's theorem
The exact linear Turán number of the sail
A characterization of easily testable induced digraphs and \(k\)-colored graphs
The spectral radius of graphs with no intersecting odd cycles
Induced arithmetic removal: complexity 1 patterns over finite fields
Multicolor Turán numbers
The linear Turán number of small triple systems or why is the wicket interesting?
A unique characterization of spectral extrema for friendship graphs
3-uniform hypergraphs without a cycle of length five
Efficient removal lemmas for matrices
The maximum spectral radius of graphs without friendship subgraphs
Average Gromov hyperbolicity and the Parisi ansatz
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
Colorings with only rainbow arithmetic progressions
Sparse hypergraphs: new bounds and constructions
Turán and Ramsey numbers in linear triple systems
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
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
Degenerate Turán densities of sparse hypergraphs
The Brown-Erdős-Sós conjecture in finite abelian groups
Minimum number of edges that occur in odd cycles
A tight bound for hypergraph regularity
Turán numbers and batch codes
A relative Szemerédi theorem
The removal lemma for tournaments
Extremal results in sparse pseudorandom graphs
On a problem of Erdős and Rothschild on edges in triangles
Multiple recurrence in quasirandom groups
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
Roth-type theorems in finite groups
On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
On 0-1 matrices and small excluded submatrices
On the algebraic and topological structure of the set of Turán densities
On the maximum number of integer colourings with forbidden monochromatic sums
Maximal independent sets in clique-free graphs
Triangles in graphs without bipartite suspensions
Some exact results of the generalized Turán numbers for paths
Additive combinatorics: with a view towards computer science and cryptography -- an exposition
Regularity lemmas and combinatorial algorithms
The number of the maximal triangle-free graphs
Testability and repair of hereditary hypergraph properties
Generalizations of Fourier analysis, and how to apply them
Mantel's theorem for random graphs
Short proofs of some extremal results. II.
Online containers for hypergraphs, with applications to linear equations
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Lower bounds for combinatorial algorithms for Boolean matrix multiplication
On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
Small cores in 3-uniform hypergraphs
A new proof of Roth’s theorem on arithmetic progressions
Saturating Sperner families
Color the cycles
On regular hypergraphs of high girth
scientific article; zbMATH DE number 1501963 (Why is no real title available?)
New applications of the polynomial method: the cap set conjecture and beyond
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
On possible Turán densities
Turán problems and shadows. I: Paths and cycles
A counterexample to sparse removal
On the KŁR conjecture in random graphs
The strong chromatic index of sparse graphs
Simple analysis of graph tests for linearity and PCP
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

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)