The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2011.03.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099921939 / rank | |||
Normal rank | |||
Revision as of 21:28, 19 March 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
