Colouring set families without monochromatic \(k\)-chains (Q2326327): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcta.2019.05.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTA.2019.05.014 / rank | |||
Normal rank | |||
Latest revision as of 00:42, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring set families without monochromatic \(k\)-chains |
scientific article |
Statements
Colouring set families without monochromatic \(k\)-chains (English)
0 references
7 October 2019
0 references
Erdős-Rothschild problems
0 references
Sperner's theorem
0 references
\(k\)-chains
0 references
\((r, k)\)-colourings
0 references
0 references
0 references
0 references
0 references
