An upper bound for the Turán number \(t_3(n,4)\)
From MaRDI portal
Publication:1304632
DOI10.1006/jcta.1998.2961zbMath0946.05063MaRDI QIDQ1304632
Publication date: 23 October 2000
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1998.2961
Related Items
An Irrational Lagrangian Density of a Single Hypergraph, A geometric theory for hypergraph matching, On Turán numbers for disconnected hypergraphs, Uniform Turán density of cycles, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, Saturating Sperner families, Turán problems on non-uniform hypergraphs, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Hypergraphs with independent neighborhoods, On Turán densities of small triple graphs, Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\), Symmetry in Turán sums of squares polynomials from flag algebras, The combinatorics of Dom de Caen, On the Turán number of triple systems, Improved bounds on a generalization of Tuza's conjecture, A hypergraph Turán problem with no stability, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, On the triangle clique cover and \(K_t\) clique cover problems, On Turán's \((3,4)\)-problem with forbidden subgraphs, Turán, involution and shifting, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, The Turán number of directed paths and oriented cycles
Cites Work
