Colouring set families without monochromatic \(k\)-chains (Q2326327)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Colouring set families without monochromatic k-chains |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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.8357799649238586
0 references
0.834280252456665
0 references
0.7939940690994263
0 references
0.7884145379066467
0 references
0.7870097160339355
0 references
