Abstract
Let denote the crossing number of a graph . The well-known Zarankiewicz's conjecture (ZC) asserted in 1954. In 1971, Harborth gave a conjecture (HC) on . HC on is verified if ZC is true by Ho et al. in 2021. In this paper, we showed the following results: If both and are even, then If both and are odd, then If is even and is odd, then \begin{equation}\nonumber \begin{split} \textrm{cr}(K_{1,1,m,n})&\geq \frac{1}{4}(\textrm{cr}(K_{m+1,n+2})+\textrm{cr}(K_{m+3,n+2})+2\textrm{cr}(K_{2,m,n}) \\&-m(n+1)-\frac{1}{4}(n+1)^2). \end{split} \end{equation} The lower bounds in our result imply that if both and are even and ZC is true, then HC on holds; if at least one of and is odd and both ZC and HC on are true, then HC on holds.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.