Weakened Gallai–Ramsey number for various graphs of order up to six
| dc.contributor.author | Jakhar, Jagjeet | |
| dc.date.accessioned | 2026-03-27T09:57:28Z | |
| dc.date.available | 2026-03-27T09:57:28Z | |
| dc.date.issued | 2026 | |
| dc.description.abstract | Gallai–Ramsey theory examines how edge colorings of complete graphs avoiding rain bow triangles inevitably yield monochromatic subgraphs. In this work, we generalize this framework by introducing the weakened Gallai–Ramsey number grs t(G), defined as the smallest integer p such that every Gallai t-coloring of Kp contains a copy of G using at most s<t colors. We determine exact values and bounds for grs t(G) for several graph classes, including complete graphs, books, wheels, and complete bipartite graphs. These results extend classical Gallai–Ramsey theory and provide new insight into the behavior of multicolored subgraphs under constrained colorings. © 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies. | |
| dc.identifier.uri | http://cuh.ndl.gov.in/handle/123456789/1858 | |
| dc.language.iso | en | |
| dc.title | Weakened Gallai–Ramsey number for various graphs of order up to six |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Weakened Gallai–Ramsey number for various graphs of order up to six.pdf
- Size:
- 470.6 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: