The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimum size of 3-graphs without a 4-set spanning no or exactly three edges |
scientific article; zbMATH DE number 5982461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum size of 3-graphs without a 4-set spanning no or exactly three edges |
scientific article; zbMATH DE number 5982461 |
Statements
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (English)
0 references
29 November 2011
0 references
extremal hypergraphs
0 references
stability result
0 references
extremal function
0 references
0 references
0.7779800891876221
0 references
0.7760969400405884
0 references
0.766646146774292
0 references
0.7599519491195679
0 references
0.7593750357627869
0 references
