Search arXivSearch

arXiv · 2609.20071

Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number?

Abstract

Löfberg and Qi introduced the second order Zarankiewicz number \(z_2\), the recursive-line Zarankiewicz number \(z_{RL}\), and the signed Zarankiewicz number \(z_{SL}\) for doubly simple biquadratic forms. It was shown that \[ z_2(m,n)\ge z_{SL}(m,n)\ge z_{RL}(m,n) \] for all \(m\) and \(n\). However, there was no evidence that there exist particular \(m\) and \(n\) such that \(z_{SL}(m,n)>z_{RL}(m,n)\). The motivation for introducing \(z_{SL}\) was as follows: during the study of the exceptional case \(m=15\), \(n=6\), Löfberg and Qi showed that \[ z_2(15,6)=z_{SL}(15,6)=60, \] but the exact value of \(z_{RL}(15,6)\) was unknown then. In this paper we show that \[ z_{RL}(15,6)=60. \] This eliminates the motivation for introducing \(z_{SL}\). Whether \(z_{SL}(m,n)=z_{RL}(m,n)\) in general remains an open problem. Recently, Lebedev presented an explicit construction separating the augmented Zarankiewicz number \(z_A\) from the limited augmented Zarankiewicz number \(z_L\) at \(m=n=1893\). We hope that the separation problem for \(z_{SL}\) and \(z_{RL}\) can also be solved. We also present the exact values of \(z_{RL}(m,6)\) for \(6\le m\le 16\).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiwei Chen, Yannan Chen, Liqun Qi. 2026-09-17. Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number?. https://arxiv.org/abs/2609.20071

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO