Colouring set families without monochromatic k-chains
Metadata only
Date
2019-11Type
- Journal Article
Publication status
publishedExternal links
Journal / series
Journal of Combinatorial Theory. Series AVolume
Pages / Article No.
Publisher
ElsevierSubject
Erdős–Rothschild problems; Sperner's Theorem; k-chains; (r,k)-colouringsOrganisational unit
03993 - Sudakov, Benjamin / Sudakov, Benjamin
Funding
175573 - Extremal problems in combinatorics (SNF)
More
Show all metadata