An upper bound for the Turán number \(t_3(n,4)\)

DOI10.1006/jcta.1998.2961zbMath0946.05063MaRDI QIDQ1304632

Linyuan Lu, Fan R. K. Chung

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

zbMATH Keywords

hypergraph; Turán number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

Related Items

A geometric theory for hypergraph matching, 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}\), The combinatorics of Dom de Caen, On the Turán number of triple systems, On Turán's \((3,4)\)-problem with forbidden subgraphs, 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

Cites Work

• Method of quadratic forms in the Turan combinatorial problem
• A class of constructions for Turan's (3,4)-problem
• Upper bounds for Turán numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item