New paper details exact Zarankiewicz numbers for bipartite graphs

Researchers have published a paper detailing exact Zarankiewicz numbers for specific finite slices of bipartite graphs. The paper presents a computer-assisted proof for two slices, Z(12,n,3,3) for n between 18 and 22, and Z(13,22,3,3). Additionally, it provides exact values for Z(13,18,3,3), Z(14,18,3,3), Z(15,18,3,3), Z(14,17,3,3), and Z(15,17,3,3), along with a certified interval for Z(16,17,3,3). The proofs utilize a combination of certificate packages, deletion lemmas, explicit witnesses, and modular arithmetic, with all claims verified using standard-library Python. AI

RANK_REASON The cluster contains a single academic paper detailing mathematical research findings. [lever_c_demoted from research: ic=1 ai=0.0]

Read on arXiv cs.AI →

• Python
• Z(12,n,3,3)
• Z(13,18,3,3)
• Z(13,22,3,3)
• Z(14,17,3,3)
• Z(14,18,3,3)
• Z(15,17,3,3)
• Z(15,18,3,3)
• Z(16,17,3,3)
• Zarankiewicz number
• Z(m,n,s,t)

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →