The Characterization of Zero - Sum ( mod 2 ) Bipartite
نویسندگان
چکیده
Let G be a bipartite graph, with k j e(G). The zero-sum bipartite Ramsey number B(G; Z k) is the smallest integer t such that in every Z k-coloring of the edges of K t;t , there is a zero-sum mod k copy of G in K t;t. In this paper we give the rst proof which determines B(G; Z 2) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G; Z 2) can be deduced: Let G be a (not necessarily connected) bipartite graph, which can be embedded
منابع مشابه
The characterization of zero-sum (mod 2) bipartite Ramsey numbers
Let G be a bipartite graph, with k | e(G). The zero-sum bipartite Ramsey number B(G,Zk) is the smallest integer t such that in every Zk-coloring of the edges of Kt,t, there is a zero-sum mod k copy of G in Kt,t. In this paper we give the first proof which determines B(G,Z2) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G,Z2) can be deduced: Let G...
متن کاملDiagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
Let G be a subgraph of a complete bipartite graph Kn,n. Let N(G) be a 0-1 incidence matrix with edges of Kn,n against images of G under the automorphism group of Kn,n. A diagonal form of N(G) is found for every G, and whether the row space of N(G) over Zp contains the vector of all 1’s is determined. This re-proves Caro and Yuster’s results on zero-sum bipartite Ramsey numbers [3], and provides...
متن کاملA Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers
THEOREM. Let G be a graph on n vertices and an euen number of edges. Then the zero-sum (mod 2) Ramsey numbers are given by {i +2 R(G, ~2) = + 1 +t ifG=Kn, n =0,1(mod4) if all the degrees in G are odd otherwise. 0 (mod 2) This settles several problems raised mainly by Noga Alon, Arie Bialostocki, and Yehuda Roditty.
متن کامل$C_4$-free zero-divisor graphs
In this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $C_4$-free.
متن کاملThe ( mod , integral and exclusive ) sum number of graph
In this paper, we developed some new formulae for exclusive sum number of the complete bipartite graph , n m K . Also we show that for , 2 2 , 6 n n K E n K n 2 4, 2 6, 3 n n n and 2 4 n .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007