Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-017-1829-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-017-1829-9 / rank | |||
Normal rank | |||
Latest revision as of 03:17, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) |
scientific article |
Statements
Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (English)
0 references
12 December 2017
0 references
The authors consider monochromatic matchings in any 2-edge-colorings of complete graphs. They proved that the number of such monochromatic matchings is exponential. The results improve the results known in the literature in this topic.
0 references
edge-coloring
0 references
monochromatic matchings
0 references
