scientific article; zbMATH DE number 4200236
From MaRDI portal
Publication:3348932
Recommendations
Cited in
(85)- Exact solution of some Turán-type problems
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- Complexity of choosing subsets from color sets
- Ranks of matrices with few distinct entries
- Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- A hypergraph extension of the bipartite Turán problem
- The number of graphs without forbidden subgraphs
- On the Turán number of triple systems
- Stability theorems for cancellative hypergraphs
- Unavoidable hypergraphs
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs
- A linear hypergraph extension of Turán's theorem
- Some extremal results on hypergraph Turán problems
- Stability and exact Turán numbers for matroids
- A linear hypergraph extension of the bipartite Turán problem
- Linear Turán numbers of acyclic triple systems
- Asymptotic solution of a Turán-type problem
- Extremal Theta-free planar graphs
- Planar Turán numbers of short paths
- An L-system on the small Witt design
- Extremal \(H\)-free planar graphs
- Non-uniform Turán-type problems
- A note on a conjecture by Füredi
- Forbidden configurations: boundary cases
- Linear trees in uniform hypergraphs
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- The Turán problem for projective geometries
- The co-degree density of the Fano plane
- A hypergraph extension of Turán's theorem
- Co-degree density of hypergraphs
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- New lower bounds for the Turán density of PG_m(q)
- Note on a Turán-type problem on distances.
- Codegree thresholds for covering 3-uniform hypergraphs
- Unavoidable subhypergraphs: a-clusters
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3844296 (Why is no real title available?)
- scientific article; zbMATH DE number 3851148 (Why is no real title available?)
- On sunflowers and matrix multiplication
- On minimum saturated matrices
- scientific article; zbMATH DE number 3827993 (Why is no real title available?)
- scientific article; zbMATH DE number 3935081 (Why is no real title available?)
- scientific article; zbMATH DE number 4008442 (Why is no real title available?)
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- scientific article; zbMATH DE number 1344935 (Why is no real title available?)
- Codegree Turán density of complete r-uniform hypergraphs
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
- On possible Turán densities
- Turán problems and shadows. I: Paths and cycles
- scientific article; zbMATH DE number 1439495 (Why is no real title available?)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Uniform eventown problems
- Turán numbers of sunflowers
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- Set families with a forbidden pattern
- On a problem in the geometry of numbers
- Universal and unavoidable graphs
- Extremal \(P_8\)-free/\(P_9\)-free planar graphs
- On Turán numbers for disconnected hypergraphs
- On sparse parity check matrices (extended abstract)
- Set systems without a 3-simplex
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- Spectral Turán-type problems on cancellative hypergraphs
- Extremal graphs without exponentially small bicliques
- An improved upper bound for planar Turán number of double star \(S_{2 , 5}\)
- A note on stability results for Berge-\( K_{s , t}\) hypergraphs
- A note on the minimum size of Turán systems
- On the spectral Turán problems for bipartite hypergraphs
- Separating hypergraph Turán densities
- The spectral radius of the hypergraphs without the expansion of P₃ or Berge-P_k
- Linear Turán problems with bounded matching number in hypergraphs
- Turán problems for star-path forests in hypergraphs
- On hypergraph Turán problems with bounded matching number
- L-systems and the Lovász number
- Hypergraphs accumulate
- Constructions of Turán systems that are tight up to a multiplicative constant
- On dp-minimal expansions of the integers
- A criterion for Andrásfai-Erdős-Sós type theorems and applications
- Two extremal problems in linear hypergraphs
- Invitation to intersection problems for finite sets
- The DNF exception problem
- The maximal length of a gap between r-graph Turán densities
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 Q3348932)
