scientific article

From MaRDI portal
Publication:3348932

zbMath0727.05032MaRDI QIDQ3348932

Zoltan Fueredi

Publication date: 1991


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The DNF exception problem, Universal and unavoidable graphs, Stability theorems for cancellative hypergraphs, An \(L\)-system on the small Witt design, Turán numbers of sunflowers, Co-degree density of hypergraphs, Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$, Some extremal results on hypergraph Turán problems, Codegree Turán Density of Complete $r$-Uniform Hypergraphs, On sunflowers and matrix multiplication, On minimum saturated matrices, Extremal \(H\)-free planar graphs, The maximal length of a gap between \(r\)-graph Turán densities, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, Ranks of matrices with few distinct entries, Extremal \(P_8\)-free/\(P_9\)-free planar graphs, On Turán numbers for disconnected hypergraphs, Unnamed Item, On sparse parity check matrices (extended abstract), Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation, Set systems without a 3-simplex, New lower bounds for the Turán density of \(PG_m(q)\), The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, On possible Turán densities, A linear hypergraph extension of the bipartite Turán problem, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Uniform eventown problems, Linear Turán numbers of acyclic triple systems, Unavoidable hypergraphs, Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations, Set families with a forbidden pattern, Non-uniform Turán-type problems, A note on a conjecture by Füredi, Decomposing uniform hypergraphs into uniform hypertrees and single edges, Forbidden configurations: boundary cases, Linear trees in uniform hypergraphs, Invitation to intersection problems for finite sets, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Codegree Thresholds for Covering 3-Uniform Hypergraphs, The maximum size of 3-uniform hypergraphs not containing a Fano plane, A hypergraph extension of the bipartite Turán problem, The number of graphs without forbidden subgraphs, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Extremal Theta-free planar graphs, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, The Turán problem for projective geometries, Complexity of choosing subsets from color sets, Planar Turán numbers of short paths, Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs, The co-degree density of the Fano plane, A hypergraph extension of Turán's theorem, On the Turán number of triple systems, A linear hypergraph extension of Turán's theorem