On Extremal <i>k</i>-Graphs Without Repeated Copies of 2-Intersecting Edges (Q3519213)
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: On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Extremal <i>k</i>-Graphs Without Repeated Copies of 2-Intersecting Edges |
scientific article |
Statements
On Extremal <i>k</i>-Graphs Without Repeated Copies of 2-Intersecting Edges (English)
0 references
13 August 2008
0 references
combinatorial design
0 references
hypergraph
0 references
packing
0 references
0.8068580627441406
0 references
0.8027254343032837
0 references
0.8013895153999329
0 references
0.7945831418037415
0 references
0.7916505932807922
0 references
