TITLE

Lower bounds of the size multipartite Ramsey numbers mj(Pn,Kj×b)

AUTHOR(S)
Sy, Syafrizal; Baskoro, Edy Tri
PUB. DATE
May 2012
SOURCE
AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p259
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
For given two graphs G1 and G2, the size Ramsey multipartite numbers mj(G1,G2) is the smallest integer t such that every factorization of graph Kj×t := F1 + F2 satisfies the following condition: either F1 contains G1 as a subgraph or F2 contains G2 as a subgraph. In this paper, we derive some lower bound for the size multipartite Ramsey numbers mj(Pn,Kj×b) with integers j,n ≥ 3 and b ≥ 2.
ACCESSION #
75526981

 

Related Articles

  • Restricted Size Ramsey Number for P3 versus Small Paths. Silaban, Denny Riama; Baskoro, E. T.; Uttunggadewa, Saladin // AIP Conference Proceedings;2016, Vol. 1707 Issue 1, p1 

    Let F,G, and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exist a monochromatic G or H in F. The Ramsey number r(G;H) is defined as min f|V(F)| : F → (G,H)g, the size Ramsey number ȓ(G,H) is defined as min f|E(F)| : F →(G,H), and...

  • CHARACTERIZING CARTESIAN FIXERS AND MULTIPLIERS. Benecke, Stephen; Mynhardt, Christina M. // Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 1, p161 

    Let G ⇔ H denote the Cartesian product of the graphs G and H. In 2004, Hartnell and Rall [On dominating the Cartesian product of a graph and K2, Discuss. Math. Graph Theory 24(3) (2004), 389-402] characterized prism fixers, i.e., graphs G for which γ(G ⇔ K2) = γ(G), and noted...

  • Exponents of two-colored digraphs consisting of two cycles. Suwilo, Saib // AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p297 

    A two-colored digraph D(2) is a digraph D whose each of its arc is colored by either red or blue. For nonnegative integers s and t with s+t > 0, an (s, t)-walk in a two-colored digraph is a walk of length s+t consisting of s red arcs and t blue arcs. The vector (s, t)T is the composition of the...

  • RAINBOW CONNECTION NUMBER OF DENSE GRAPHS. XUELIANG LI; MENGMENG LIU; SCHIERMEYER, INGO // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 3, p603 

    An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we...

  • Connected size Ramsey numbers of matchings and stars. Rahadjeng, Budi; Baskoro, Edy Tri; Assiyatun, Hilda // AIP Conference Proceedings;2016, Vol. 1707 Issue 1, p1 

    Let F, G, and H be finite, simple, and undirected graphs. The notation F → (G,H) means that if the edge set of F is arbitrarily colored by red or blue, then there always exists either a red copy of G or a blue copy of H. The connected size Ramsey number ȓc(G,H) is min{|E(F)| : F...

  • TREE-PATH SIZE BIPARTITE RAMSEY NUMBERS. Syafrizal Sy // Far East Journal of Mathematical Sciences;May2013, Vol. 76 Issue 1, p139 

    For graphs G1 and G2, the size bipartite Ramsey number m2(G1, G2 ) is the least natural number t such that any red-blue coloring on the edges of K jxt necessarily forces a red G or a blue H as a subgraph. In this note, we determine the exact values of m2(Pn, Ts ) for all integers n, s ≥2,...

  • On Some Ramsey Numbers for Quadrilaterals Versus Wheels. Dybizbański, Janusz; Dzido, Tomasz // Graphs & Combinatorics;May2014, Vol. 30 Issue 3, p573 

    For given graphs G and G, the Ramsey number R( G, G) is the least integer n such that every 2-coloring of the edges of K contains a subgraph isomorphic to G in the first color or a subgraph isomorphic to G in the second color. Surahmat et al. proved that the Ramsey number $${R(C_4, W_n) \leq n +...

  • Three Results on Cycle-Wheel Ramsey Numbers. Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun // Graphs & Combinatorics;Nov2015, Vol. 31 Issue 6, p2467 

    Given two graphs $$G_1$$ and $$G_2$$ , the Ramsey number $$R(G_1, G_2)$$ is the smallest integer $$N$$ such that, for any graph $$G$$ of order $$N$$ , either $$G_1$$ is a subgraph of $$G$$ , or $$G_2$$ is a subgraph of the complement of $$G$$ . We consider the case that $$G_1$$ is a cycle and...

  • Split Permutation Graphs. Korpelainen, Nicholas; Lozin, Vadim; Mayhill, Colin // Graphs & Combinatorics;May2014, Vol. 30 Issue 3, p633 

    The class of split permutation graphs is the intersection of two important classes, the split graphs and permutation graphs. It also contains an important subclass, the threshold graphs. The class of threshold graphs enjoys many nice properties. In particular, these graphs have bounded...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics