Counting substructures. II: Hypergraphs (Q485550): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00493-013-2638-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00493-013-2638-2 / rank | |||
Normal rank | |||
Latest revision as of 18:56, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting substructures. II: Hypergraphs |
scientific article |
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
