搜索结果: 1-1 共查到“理学 Turan concerning rectangle-free subsets of the grid”相关记录1条 . 查询时间(0.156 秒)
A new approach to the results of Kovari, Sos, and Turan concerning rectangle-free subsets of the grid
Turan concerning rectangle-free subsets of the grid Combinatorics
2012/6/21
For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are ...