Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Meysam Miralaei"'
Autor:
Ramin Javadi, Meysam Miralaei
Publikováno v:
پژوهشهای ریاضی, Vol 7, Iss 3, Pp 485-494 (2021)
The size-Ramsey number of a graph denoted by is the smallest integer such that there is a graph with edges with this property that for any coloring of the edges of with colors, contains a monochromatic copy of. The investigation of the size-Ramsey nu
Externí odkaz:
https://doaj.org/article/4a6124a8cde6458a88440a1bc6d29512
The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$, that is, with the property that any 2-colouring of the edges of $G$ contains a monochromatic copy of $F$. We prove that the size-Ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c2dab95230d95f27ef44a9df36e6e9e
Autor:
Maryam Shahsiah, Meysam Miralaei
Publikováno v:
Discrete Mathematics. 343:111899
For given graphs H 1 , … , H t , we say that G is Ramsey for H 1 , … , H t and we write G ⟶ ( H 1 , … , H t ) , if no matter how one colors the edges of G with t colors, say 1 , … , t , there exists a monochromatic copy of H i in the i th c
Publikováno v:
Chinese Journal of Mathematics. 2014:1-10
In the following text, we want to study the behavior of one point compactification operator in the chain Ξ := {Metrizable, Normal, T2, KC, SC, US, T1, TD, TUD, T0, Top} of subcategories of category of topological spaces, Top (where we denote the sub
The size Ramsey number $ \hat{r}(G,H) $ of two graphs $ G $ and $ H $ is the smallest integer $ m $ such that there exists a graph $ F $ on $ m $ edges with the property that every red-blue colouring of the edges of $ F $, yields a red copy of $ G $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01972701b739f8a9cfa4ca6f5ba17175
http://arxiv.org/abs/1601.06599
http://arxiv.org/abs/1601.06599