Samana, Decha

Loading...
Thumbnail Image
Preferred name
Samana, Decha
Alternative Name
Samana, D.
Main Affiliation
Email
decha.sa@kmitl.ac.th

Settings

Now showing 1 - 5 of 5
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    The tripartite Ramsey numbers rt(C4;2) and rt(C4;3)
    (2014-01-01)
    Buada, S.
    ;
    Samana, D.
    ;
    Longani, V.
    The k-colored tripartite Ramsey numbers r<inf>t</inf>(G; k) is the smallest positive integer n such that any k-coloring of lines of a complete tripartite graph K<inf>n,n,n</inf> there always exists a monochromatic subgraph isomorphic to G. When G is C<inf>4</inf> it is known, but unpublished in a journal, that r<inf>t</inf>(C<inf>4</inf>; 2) = 3. In this paper we simplify the proof of r<inf>t</inf>(C<inf>4</inf>; 2) = 3 and show the new result that r<inf>t</inf>(C<inf>4</inf>; 3) = 7.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    An Improved Lower Bound for Bipartite Ramsey Numbers br(2,7) and br(2,8)
    (2017-01-01)
    Samana, Decha
    ;
    Intarapaiboon, Peerasak
    For complete bipartite graphs Ks,s,Kt,t, the bipartite Ramsey number br(s,t) is the least positive integer b such that if the edges of K<inf>b,b</inf> are colored with red and blue, then there always exists a red Ks,s or a blue Kt,t. We obtain new lower bounds of br(2,7) and br(2,8).
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Lower bounds of some small bipartite ramsey numbers br(K 2,2 ;k nn, )
    (2017-07-01)
    Adsawatithisakul, Nitiphoom
    ;
    Summart, Waraporn
    ;
    Samana, Decha
    For bipartite graphs G <inf>1</inf> , G <inf>2</inf> , the bipartite Ramsey number br(G <inf>1</inf> ,G <inf>2</inf> ) is the smallest integer b such that any subgraph G of the complete bipartite graph K <inf>bb,</inf> , either G contains a copy of G <inf>1</inf> or its complement relative to K <inf>bb,</inf> contains a copy of G <inf>2</inf> . We obtained lower bounds of br(K <inf>2,2</inf> ;K <inf>nn,</inf> ) for 6≤ n ≤10.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Lower bounds of multicolor bipartite Ramsey numbers br(K p,q;m)
    (2012-10-16)
    Samana, Decha
    The multicolor bipartite Ramsey number br(K <sup>p,q</sup> ;m) is the smallest positive n such that any coloring of the edges of K <sup>n,n</sup> with m-coloring, there are a monochromatic subgraph isomorphic to K <sup>p,q</sup>. In this paper, we show that br(K <sup>p,q</sup>;m) > (p!q!m <sup>p,q-1</sup>) <sup>1/p+q</sup>.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A note on the tripartite ramsey numbers rt(C4;2) AND rt(C4;3)
    (2015-01-01)
    Buada, S.
    ;
    Samana, D.
    ;
    Longani, V.
    The k-colored tripartite Ramsey numbers r<inf>t</inf>(G; k) is the smallest positive integer n such that any k-coloring of lines of a complete tripartite graph K<inf>n,n,n</inf> there always exists a monochromatic subgraph isomorphic to G. The values of r<inf>t</inf>(C<inf>4</inf>; 2) = 3, and r<inf>t</inf>(C<inf>4</inf>;3) = 7 are discussed in the article The tripartite Ramsey numbers r<inf>t</inf>(C<inf>4</inf>; 2) and r<inf>t</inf>(C<inf>4</inf>;3) of the Italian Journal of Pure and Applied Mathematics, n. 33-2014. However, there are our technical mistakes on three figures of the article. In this note we correct these mistakes.