Counting substructures. II: Hypergraphs (Q485550): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2108398244 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0905.1963 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-graphs without two triples whose symmetric difference is contained in a third / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum size of 3-uniform hypergraphs not containing a Fano plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a theorem of Rademacher-Turán / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5724802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic solution of a Turán-type problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quadruple systems with independent neighborhoods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Triple Systems with Independent Neighbourhoods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 4-books of three pages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triple Systems Not Containing a Fano Configuration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4500699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stability theorems for cancellative hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a hypergraph Turán problem of Frankl / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Turán number of the Fano plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3669452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hypergraph extension of Turán's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting substructures. I: Color critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new generalization of Mantel's theorem to \(k\)-graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Turán number of triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of cliques in graphs of given order and size / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An exact Turán result for the generalized triangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Minimal Density of Triangles in Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of the regularity lemma for uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5548826 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A variant of the hypergraph removal lemma / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:52, 9 July 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