The largest minimum codegree of a 3-graph without a generalized 4-cycle (Q4903265)
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 largest minimum codegree of a 3-graph without a generalized 4-cycle |
scientific article; zbMATH DE number 6127313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The largest minimum codegree of a 3-graph without a generalized 4-cycle |
scientific article; zbMATH DE number 6127313 |
Statements
The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle (English)
0 references
21 January 2013
0 references
maximum number of edges in a graph with no 4-cycle
0 references
0.7828806042671204
0 references
0.7821604013442993
0 references
0.7697051763534546
0 references
0.7633821964263916
0 references
