location:  Publications → journals
Search results

Search: MSC category 05C55 ( Generalized Ramsey theory [See also 05D10] )

 Expand all        Collapse all Results 1 - 2 of 2

1. CMB Online first

Raeisi, Ghaffar; Zaghian, Ali
 Ramsey Number of Wheels Versus Cycles and Trees Let $G_1, G_2, \dots , G_t$ be arbitrary graphs. The Ramsey number $R(G_1, G_2, \dots, G_t)$ is the smallest positive integer $n$ such that if the edges of the complete graph $K_n$ are partitioned into $t$ disjoint color classes giving $t$ graphs $H_1,H_2,\dots,H_t$, then at least one $H_i$ has a subgraph isomorphic to $G_i$. In this paper, we provide the exact value of the $R(T_n,W_m)$ for odd $m$, $n\geq m-1$, where $T_n$ is either a caterpillar, a tree with diameter at most four or a tree with a vertex adjacent to at least $\lceil \frac{n}{2}\rceil-2$ leaves. Also, we determine $R(C_n,W_m)$ for even integers $n$ and $m$, $n\geq m+500$, which improves a result of Shi and confirms a conjecture of Surahmat et al. In addition, the multicolor Ramsey number of trees versus an odd wheel is discussed in this paper. Keywords:Ramsey number, wheel, tree, cycleCategories:05C15, 05C55, 05C65

2. CMB 2013 (vol 57 pp. 631)

Sokić, Miodrag
 Indicators, Chains, Antichains, Ramsey Property We introduce two Ramsey classes of finite relational structures. The first class contains finite structures of the form $(A,(I_{i})_{i=1}^{n},\leq ,(\preceq _{i})_{i=1}^{n})$ where $\leq$ is a total ordering on $A$ and $% \preceq _{i}$ is a linear ordering on the set $\{a\in A:I_{i}(a)\}$. The second class contains structures of the form $(A,\leq ,(I_{i})_{i=1}^{n},\preceq )$ where $(A,\leq )$ is a weak ordering and $% \preceq$ is a linear ordering on $A$ such that $A$ is partitioned by $% \{a\in A:I_{i}(a)\}$ into maximal chains in the partial ordering $\leq$ and each $\{a\in A:I_{i}(a)\}$ is an interval with respect to $\preceq$. Keywords:Ramsey property, linear orderingsCategories:05C55, 03C15, 54H20
 top of page | contact us | privacy | site map |