ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Zarankiewicz’s problem is one of the long-standing open problems in Extremal Graph Theory asking to find the maximum number of edges in a bipartite graph G with parts of size m and n, which does not contain a complete bipartite graph with parts of size s and t. The main question in this area is the well- known log-rank conjecture of Lovász and Saks [10], which is one of the fundamen- tal open problems in communication complexity. While the log-rank conjecture is still outside the reach of known techniques, Lovett\sqrt{ } [11] showed that one can always find a monochromatic subma- trix of size 2−O( r log r) n. The report passage is retained verbatim as the relevant context for this extracted problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.