Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-017-1829-9 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-017-1829-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2735005752 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremality of degree-based graph entropies / rank | |||
Normal 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 / cites work | |||
| Property / cites work: Q5548200 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5408316 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5408327 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5408268 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a conjecture about tricyclic graphs with maximal energy / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-017-1829-9 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
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
