Bipartite algebraic graphs without quadrilaterals
Abstract
Let Ps be the s-dimensional complex projective space, and let X, Y be two non-empty open subsets of Ps in the Zariski topology. A hypersurface H in Ps×Ps induces a bipartite graph G as follows: the partite sets of G are X and Y, and the edge set is defined by uv if and only if (u,v)∈ H. Motivated by the Tur\'an problem for bipartite graphs, we say that H (X× Y) is (s,t)-grid-free provided that G contains no complete bipartite subgraph that has s vertices in X and t vertices in Y. We conjecture that every (s,t)-grid-free hypersurface is equivalent, in a suitable sense, to a hypersurface whose degree in y is bounded by a constant d = d(s,t), and we discuss possible notions of the equivalence. We establish the result that if H(X× P2) is (2,2)-grid-free, then there exists F∈ C[x,y] of degree 2 in y such that H(X× P2) = \F = 0\ (X× P2). Finally, we transfer the result to algebraically closed fields of large characteristic.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.