Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-011-1051-0 / rank | |||
| Property / cites work | |||
| Property / cites work: The Ramsey number for stripes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex coverings by monochromatic cycles and trees / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-011-1051-0 / rank | |||
Normal rank | |||
Latest revision as of 13:00, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) |
scientific article |
Statements
Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (English)
0 references
27 December 2012
0 references
2-edge-coloring
0 references
monochromatic subgraph
0 references
1-factor
0 references
