An upper bound for the Turán number \(t_3(n,4)\) (Q1304632)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1340121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the Turán number \(t_3(n,4)\) |
scientific article; zbMATH DE number 1340121 |
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
0.8432918787002563
0 references
0.8265882134437561
0 references
0.8261734843254089
0 references
0.8259420394897461
0 references
