Content deleted Content added
No edit summary |
Submitting using AfC-submit-wizard |
||
Line 1:
{{AFC submission|d|neo|u=Nmath2|ns=118|decliner=ToBeFree|declinets=20211214214740|ts=20211214181236}} <!-- Do not remove this line! -->▼
{{Short description|Method in combinatorics}}
{{Draft topics|mathematics}}
{{AfC topic|stem}}
{{AfC submission|||ts=20220214135021|u=Nmath2|ns=118}}
▲{{AFC submission|d|neo|u=Nmath2|ns=118|decliner=ToBeFree|declinets=20211214214740|ts=20211214181236}} <!-- Do not remove this line! -->
The method of (hypergraph) containers is a powerful tool that can help characterize the typical structure and/or answer extremal questions about families of discrete objects with a prescribed set of local constraints. Such questions arise naturally in [[extremal graph theory]], [[additive combinatorics]], [[discrete geometry]], [[coding theory]], and [[Ramsey theory]]; they include some of the most classical problems in the associated fields.
| |||