One-inclusion hypergraph density revisited (Q991799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5780830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-inclusion hypergraph density revisited |
scientific article; zbMATH DE number 5780830 |
Statements
One-inclusion hypergraph density revisited (English)
0 references
7 September 2010
0 references
combinatorial problems
0 references
one-inclusion hypergraph
0 references
pseudo-dimension
0 references
graph-dimension
0 references
mistake bound
0 references
0.7343698740005493
0 references
0.7183874249458313
0 references
0.7041999101638794
0 references
0.6970669031143188
0 references
0.69330233335495
0 references
