期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2015
卷号：12
期号：2-3
页码：221-223
DOI：10.1016/j.akcej.2015.11.018
语种：English
出版社：Elsevier
摘要：AbstractLetKn,nbe the complete bipartite graph withnvertices in each partition. We denoteM(C4,Kn,n)to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring ofKn,n. In this paper, we give an upper bound forM(C4,Kn,n)for allnusing an explicit construction.
