The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.aim.2021.107991 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AIM.2021.107991 / rank | |||
Normal rank | |||
Latest revision as of 15:08, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture |
scientific article |
Statements
The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (English)
0 references
27 October 2021
0 references
junta method
0 references
extremal combinatorics
0 references
discrete Fourier analysis
0 references
Erdős-Chvátal simplex conjecture
0 references
intersection theorems
0 references
Erdős-Ko-Rado theorem
0 references
