An upper bound for the Turán number \(t_3(n,4)\)
From MaRDI portal
Publication:1304632
DOI10.1006/jcta.1998.2961zbMath0946.05063OpenAlexW2068089416MaRDI 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
Symmetry in Turán sums of squares polynomials from flag algebras, An Irrational Lagrangian Density of a Single Hypergraph, Saturating Sperner families, Turán, involution and shifting, On Turán densities of small triple graphs, On Turán numbers for disconnected hypergraphs, Uniform Turán density of cycles, A 2-stable family of triple systems, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, Four-vertex traces of finite sets, The Turán number of directed paths and oriented cycles, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, Hypergraphs with independent neighborhoods, Turán problems on non-uniform hypergraphs, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), The combinatorics of Dom de Caen, On the triangle clique cover and \(K_t\) clique cover problems, On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, A geometric theory for hypergraph matching, Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\), Improved bounds on a generalization of Tuza's conjecture, A hypergraph Turán problem with no stability, On Turán's \((3,4)\)-problem with forbidden subgraphs, On the Turán number of triple systems
Cites Work
