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