Let brk(Kt,t) be the minimum integer such that in any edge coloring of Kn,nwith K colors there is a monochromatic Kt,t,and let Z(n,t) be the maximum number of edges in a subgraph Kn,n of that contains no Kt,t.

• 在对完全二部图Kn,n进行k-边着色中,记brk(Kt,t)为能够诱导出单色Kt,t的最小的正整数n,另外,记z(n;t)为Kn,n中不含子图Kt,t最大的边数。