Loading...
Please wait, while we are loading the content...
Similar Documents
On 3-hypergraphs with forbidden 4-vertex configurations (2010).
| Content Provider | CiteSeerX |
|---|---|
| Author | Razborov, Alexander A. |
| Abstract | Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density ≥ 4/9(1 − o(1)). This bound is tight. The proof is a rather elaborate application of Cauchy-Schwarz type arguments presented in the framework of flag algebras. We include further demonstrations of this method by re-proving a few known tight results about hypergraph Turán densities and significantly improving numerical bounds for several problems for which the exact value is not known yet. |
| File Format | |
| Publisher Date | 2010-01-01 |
| Access Restriction | Open |
| Content Type | Text |