On the maximum size of connected hypergraphs without a path of given length (Q724883)
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 the maximum size of connected hypergraphs without a path of given length |
scientific article; zbMATH DE number 6910642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum size of connected hypergraphs without a path of given length |
scientific article; zbMATH DE number 6910642 |
Statements
On the maximum size of connected hypergraphs without a path of given length (English)
0 references
26 July 2018
0 references
connected hypergraph
0 references
Erdős-Gallai theorem
0 references
Berge hypergraph
0 references
0.9127405285835266
0 references
0.8535467982292175
0 references
0.84230637550354
0 references
0.8237923979759216
0 references
0.8222742080688477
0 references
