The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:47, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum size of 3-graphs without a 4-set spanning no or exactly three edges |
scientific article |
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
