Counting substructures. II: Hypergraphs (Q485550): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05A16 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05B07 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05D05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6385401 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hypergraphs | |||
| Property / zbMATH Keywords: hypergraphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
copies of graphs | |||
| Property / zbMATH Keywords: copies of graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hypergraph removal lemma | |||
| Property / zbMATH Keywords: hypergraph removal lemma / rank | |||
Normal rank | |||
Revision as of 21:25, 30 June 2023
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
