Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hexuan Zhi"'
Publikováno v:
AIMS Mathematics, Vol 8, Iss 4, Pp 8027-8033 (2023)
For two graphs $ G_1 $ and $ G_2 $, the connected size Ramsey number $ {\hat{r}}_c(G_1, G_2) $ is the smallest number of edges of a connected graph $ G $ such that if each edge of $ G $ is colored red or blue, then $ G $ contains either a red copy of
Externí odkaz:
https://doaj.org/article/25d220c82372466eac22c110a9f5a003
