Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Publication,
    The tripartite Ramsey numbers rt(C4;2) and rt(C4;3)
    (2014-01-01)
    Buada, S.
    ;
    ;
    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.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A note on the tripartite ramsey numbers rt(C4;2) AND rt(C4;3)
    (2015-01-01)
    Buada, S.
    ;
    ;
    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.