Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325)
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: Erdős-Pyber theorem for hypergraphs and secret sharing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erdős-Pyber theorem for hypergraphs and secret sharing |
scientific article |
Statements
Erdős-Pyber theorem for hypergraphs and secret sharing (English)
0 references
24 September 2015
0 references
graph covering
0 references
partition cover number
0 references
bipartite graph
0 references
uniform hypergraph
0 references
secret sharing
0 references
0.7631404995918274
0 references
0.7602927684783936
0 references
0.7544505000114441
0 references
0.7536659836769104
0 references
0.7526509165763855
0 references
