An upper bound for the Turán number \(t_3(n,4)\) (Q1304632): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:51, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the Turán number \(t_3(n,4)\) |
scientific article |
Statements
An upper bound for the Turán number \(t_3(n,4)\) (English)
0 references
23 October 2000
0 references
It is proved that the smallest number \(t_3(n,4)\) such that every 3-uniform hypergraph on \(n\) vertices with more than \(t_3(n,4)\) edges necessarily contains a complete subgraph with 4 vertices, satisfies the following upper bound: \[ \lim_{n\to\infty} {t_3(n, 4)\over{n\choose 3}}\leq {3+\sqrt{17}\over 12}. \]
0 references
Turán number
0 references
hypergraph
0 references
