Counting substructures. II: Hypergraphs (Q485550)
From MaRDI portal
!
WARNING
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 6385401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting substructures. II: Hypergraphs |
scientific article; zbMATH DE number 6385401 |
Statements
Counting substructures. II: Hypergraphs (English)
0 references
9 January 2015
0 references
Using the hypergraph removal lemma, the author gives lower bounds on the number of copies of certain hypergraphs (like the Fano plane) contained in a \(k\)-uniform hypergraph with prescribed number of vertices and edges.
0 references
hypergraphs
0 references
copies of graphs
0 references
hypergraph removal lemma
0 references
0.802238941192627
0 references
0.802238941192627
0 references
0.7928650379180908
0 references
0.7877014875411987
0 references
0.785169780254364
0 references
