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)

Many $T$ copies in $H$-free graphs
The regularity method for graphs with few 4‐cycles
Testing Linear-Invariant Properties
The spectral radius of graphs with no odd wheels
Extremal independent set reconfiguration
Triforce and corners
A variant of the Corners theorem
Counting hypergraphs with large girth
A note on the Brown-Erdős-Sós conjecture in groups
Proof of the Brown-Erdős-Sós conjecture in groups
Constructing dense grid-free linear 3-graphs
Turán number of special four cycles in triple systems
Hypergraph regularity and random sampling
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
On the existence of dense substructures in finite groups
Large girth approximate Steiner triple systems
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
Sparse hypergraphs with applications to coding theory
On 3‐graphs with no four vertices spanning exactly two edges
Multiple recurrence in quasirandom groups
The exact linear Turán number of the sail
More Turán-type theorems for triangles in convex point sets
Extremal Betti numbers of Vietoris-Rips complexes
Additive combinatorics: with a view towards computer science and cryptography -- an exposition
Efficient testing without efficient regularity
Regular decomposition of the edge set of a graph with applications
Unavoidable tournaments
Spectral radius on linear $r$-graphs without expanded $K_{r+1}$
Some exact results of the generalized Turán numbers for paths
The number of the maximal triangle-free graphs
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
The domination number of the graph defined by two levels of the $n$-cube. II
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
The spectral radius of graphs with no intersecting odd cycles
Testability and repair of hereditary hypergraph properties
A new proof of Roth’s theorem on arithmetic progressions
Ramsey numbers for nontrivial Berge cycles
Mantel's theorem for random graphs
Independent sets in hypergraphs
Regularity lemmas and combinatorial algorithms
The strong chromatic index of sparse graphs
Multicolor Turán numbers
On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
Linear saturation numbers of Berge-$C_3$ and Berge-$C_4$
Estimating parameters associated with monotone properties
Induced subgraphs of given sizes
Saturated r-uniform hypergraphs
Average Gromov hyperbolicity and the Parisi ansatz
On the algebraic and topological structure of the set of Turán densities
On possible Turán densities
A linear hypergraph extension of Turán's theorem
A linear hypergraph extension of the bipartite Turán problem
Maximal antichains of minimum size
On a conjecture of Erdős on locally sparse Steiner triple systems
3-uniform hypergraphs without a cycle of length five
The sum of nonsingular matrices is often nonsingular
A characterization of easily testable induced digraphs and $k$-colored graphs
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
Simple analysis of graph tests for linearity and PCP
The fine structure of octahedron-free graphs
The induced removal lemma in sparse graphs
Relative Turán numbers for hypergraph cycles
Supersaturation of even linear cycles in linear hypergraphs
Induced arithmetic removal: complexity 1 patterns over finite fields
The maximum spectral radius of graphs without friendship subgraphs
Minimum number of edges that occur in odd cycles
The domination number of the graph defined by two levels of the $n$-cube
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
Testing odd-cycle-freeness in Boolean functions
Minimum degree and the graph removal lemma
The removal lemma for tournaments
Generalized Turán problems for complete bipartite graphs
Book free 3-uniform hypergraphs
On the density of a graph and its blowup
Generalized Turán results for intersecting cliques
Large joints in graphs
Counting configuration-free sets in groups
Exact solution of some Turán-type problems
Turán problems and shadows. I: Paths and cycles
A tight bound for hypergraph regularity
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
New results on linear size distance preservers
Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
Arithmetic progressions, different regularity lemmas and removal lemmas
Turán numbers of $r$-graphs on $r + 1$ vertices
Online containers for hypergraphs, with applications to linear equations
Short proofs of some extremal results. II.
Maximal independent sets in clique-free graphs
Turán numbers and batch codes
On the structure of pointsets with many collinear triples
The homomorphism domination exponent
Removal lemmas and approximate homomorphisms
Roth-type theorems in finite groups
On the communication complexity of high-dimensional permutations
A counterexample to sparse removal
A relative Szemerédi theorem
A sparse regular approximation lemma
A variant of the hypergraph removal lemma
Asymptotic Structure for the Clique Density Theorem

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)