On multiplicity of quadrilaterals
Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n. In this paper, we give an upper bound for M(C4,Kn,n) for all n using an explicit construction.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2015-11-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860015000456 |