scientific article; zbMATH DE number 3407723
From MaRDI portal
Publication:5672676
Recommendations
Cited in
(71)- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- Exact solution of some Turán-type problems
- Induced subgraphs of given sizes
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
- On generalized Ramsey theory: The bipartite case
- Hypergraphs without exponents
- Turán and Ramsey numbers in linear triple systems. II
- A new bound for the Brown-Erdős-Sós problem
- Some extremal results on hypergraph Turán problems
- The linear Turán number of small triple systems or why is the wicket interesting?
- Sparse hypergraphs: new bounds and constructions
- Turán and Ramsey numbers in linear triple systems
- Turán number of special four cycles in triple systems
- Degenerate Turán densities of sparse hypergraphs
- Turán numbers and batch codes
- On extremal problems of graphs and generalized graphs
- Odd cycles and \(\Theta\)-cycles in hypergraphs
- Nonexistence of sparse triple systems over abelian groups and involutions
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- Non-uniform Turán-type problems
- On some extremal problems on r-graphs
- Regular subgraphs of uniform hypergraphs
- On a conjecture of Hilton
- On topological minors in random simplicial complexes
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3983161 (Why is no real title available?)
- An extremal problem onKr-free graphs
- Uniform hypergraphs containing no grids
- scientific article; zbMATH DE number 4311 (Why is no real title available?)
- scientific article; zbMATH DE number 6172670 (Why is no real title available?)
- A note on the Brown-Erdős-Sós conjecture in groups
- Sparse hypergraphs with applications to coding theory
- New Turán Exponents for Two Extremal Hypergraph Problems
- Constructing dense grid-free linear 3-graphs
- Triple systems with no three triples spanning at most five points
- Separating hash families: a Johnson-type bound and new constructions
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3298603 (Why is no real title available?)
- The regularity method for graphs with few 4‐cycles
- The length of an s-increasing sequence of r-tuples
- Optimal combinatorial batch codes based on block designs
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Local-vs-global combinatorics
- A new proof of the graph removal lemma
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- Turán numbers of r-graphs on r + 1 vertices
- Turán numbers and switching
- Proper edge colorings of planar graphs with rainbow \(C_4\)-s
- Total mutual-visibility in Hamming graphs
- Perfect proper edge colorings of regular bipartite graphs with rainbow \(C_4\)-\(\mathrm{s}\)
- Is it easy to regularize a hypergraph with easy links?
- Many pentagons in triple systems
- Improvements on induced subgraphs of given sizes
- A new approach for the Brown-Erdős-Sós problem
- Separating hash families with large universe
- On a problem of Brown, Erdős and Sós
- A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
- Mutual and total mutual visibility in hypercube-like graphs
- A new approach for the Brown-Erdős-Sós problem (extended abstract)
- Generalized Ramsey numbers at the linear and quadratic thresholds
- High-girth Steiner triple systems
- On generalized Ramsey numbers in the non-integral regime
- The generalized Ramsey number \(f(n,5,8)=\frac{6}{7}n+o(n)\)
- On the quadratic 8-edge case of the Brown-Erdős-Sós problem
- Avoiding range via Turán-type bounds
- On the ( k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7
- Asymptotic solution for a new class of forbidden r-graphs
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 Q5672676)
