For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n$ that has no complete biparitite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices in the part of size $n$. A simple argument shows that, for each $t \geq 2$, $Z_{2,t}(m,n)=(t-1)\binom{m}{2}+n$ when $n \geq (t-1)\binom{m}{2}$. Here, for large $m$, we determine the exact value of $Z_{2,t}(m,n)$ in almost all of the remaining cases where $n=Θ(tm^2)$. We establish a new family of upper bounds on $Z_{2,t}(m,n)$ which complement a family already obtained by Roman. We then prove that the floor of the best of these bounds is almost always achieved. We also show that there are cases in which this floor cannot be achieved and others in which determining whether it is achieved is likely a very hard problem. Our results are proved by viewing the problem through the lens of linear hypergraphs and our constructions make use of existing results on edge decompositions of dense graphs.
Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number?
School of Mathematical Sciences, South China Normal University(华南师范大学数学学院);Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学研究中心);Department of Applied Mathematics, The Hong Kong Polytechnic University(香港理工大学应用数学系)
Optimization Models and Computational Bounds for Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs
School of Mathematics, Southeast University(东南大学数学学院);Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学研究中心);School of Science, Zhejiang University of Science and Technology(浙江科技大学理学院);Department of Applied Mathematics, The Hong Kong Polytechnic University(香港理工大学应用数学系)
Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学省部共建协同创新中心);Department of Applied Mathematics, The Hong Kong Polytechnic University(香港理工大学应用数学系);School of Mathematical Sciences, Beihang University(北京航空航天大学数学科学学院)
Exact Second-Order Zarankiewicz Numbers for Complete-Graph Incidence Families
South China Normal University(华南师范大学);Linköping University(林雪平大学);Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学省级科研中心);The Hong Kong Polytechnic University(香港理工大学)
Linköping University(林雪平大学);Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学研究中心);The Hong Kong Polytechnic University(香港理工大学)
A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs
Zhejiang University of Science and Technology(浙江科技大学);The Hong Kong Polytechnic University(香港理工大学);Beihang University(北京航空航天大学);Southeast University(东南大学);Jiangsu Provincial Scientific Research Center of Applied Mathematics(江苏省应用数学研究中心)