首页 | 本学科首页   官方微博 | 高级检索  
     


Bipartite algebraic graphs without quadrilaterals
Authors:Boris Bukh  Zilin Jiang
Affiliation:1. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA;2. Department of Mathematics, the Technion – Israel Institute of Technology, Technion City, Haifa 3200003, Israel
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 u¯v¯ if and only if (u¯,v¯)H. Motivated by the Turán 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 FC[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.
Keywords:Algebraic graph  Quadrilateral-free graph  Turán number
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号