Strong Ramsey Numbers of Graphs of Size 4
Mathematics · 16.06.2026 · 14 (12) · 2158
DOI: 10.3390/math14122158 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 16.06.2026. Verfasst von Gary Chartrand und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The Ramsey number R(G) of a graph G without isolated vertices is the minimum order n of the complete graph Kn for which every red-blue edge coloring results in a monochromatic subgraph isomorphic to G. The strong Ramsey number R¯(F,H) of two non-isomorphic graphs F and H without isolated vertices is the minimum positive integer n such that every red-blue coloring of Kn results in two edge-disjoint monochromatic subgraphs, one isomorphic to F and the other isomorphic to H. The numbers R¯(F,H) have been determined for all pairs F,H of non-isomorphic graphs F and H of size 3. Here, R¯(F,H) is determined for all pairs F,H of non-isomorphic graphs F and H of size 4. In each case, it is shown that R¯(F,H) is either max{R(F),R(H)} or 1+max{R(F),R(H)}. Furthermore, R¯(F,H) has been determined for some special pairs F,H of non-isomorphic graphs.
Zitieren
APA
Chartrand, G., & Zhang, P. (2026). Strong Ramsey Numbers of Graphs of Size 4. Mathematics, 14(12), 2158. https://doi.org/10.3390/math14122158
Vancouver
Chartrand G, Zhang P. Strong Ramsey Numbers of Graphs of Size 4. Mathematics. 2026;14(12):2158. doi:10.3390/math14122158
BibTeX
@article{Chartrand2026,
author = {Chartrand, Gary and Zhang, Ping},
title = {Strong Ramsey Numbers of Graphs of Size 4},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {12},
pages = {2158},
doi = {10.3390/math14122158}
}
EUVIMED