Constructing dense grid-free linear 3-graphs (Q5164032)
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: Constructing dense grid-free linear 3-graphs |
scientific article; zbMATH DE number 7423233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing dense grid-free linear 3-graphs |
scientific article; zbMATH DE number 7423233 |
Statements
Constructing dense grid-free linear $3$-graphs (English)
0 references
9 November 2021
0 references
cores in hypergraphs
0 references
Brown-Erdős-Sós conjecture
0 references
hypergraph regularity
0 references
0.8234671354293823
0 references
0.7891263961791992
0 references
0.7821807861328125
0 references
0.7773271203041077
0 references
