Bipartite algebraic graphs without quadrilaterals

被引:0
|
作者
Bukh, Boris [1 ]
Jiang, Zilin [2 ]
机构
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[2] Technion Israel Inst Technol, Dept Math, IL-3200003 Haifa, Israel
关键词
Algebraic graph; Quadrilateral-free graph; Turan number; MONOMIAL GRAPHS; TURAN NUMBERS; NORM-GRAPHS; AUTOMORPHISM; CONJECTURE; WILD;
D O I
10.1016/j.disc.2018.03.005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let P-s be the s-dimensional complex projective space, and let X, Y be two non-empty open subsets of P-s in the Zariski topology. A hypersurface H in P-s x P-s induces a bipartite graph G as follows: the partite sets of G are X and Y, and the edge set is defined by (u) over bar similar to (v) over bar if and only if ((u) over bar, (v) over bar) is an element of H. Motivated by the Turan problem for bipartite graphs, we say that H boolean AND(X 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) over bar is bounded by a constant d = d(s, t), and we discuss possible notions of the equivalence. We establish the result that if H boolean AND(X x P-2) is (2, 2)-grid-free, then there exists F is an element of CR, [(x) over bar, (y) over bar] of degree < 2 in y such that H boolean AND (X x P-2) = {F = 0} boolean AND (X x P-2). Finally, we transfer the result to algebraically closed fields of large characteristic. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:1597 / 1604
页数:8
相关论文
共 50 条
  • [21] Multiple Hamilton cycles in bipartite cubic graphs: An algebraic method
    Alahmadi, Adel N.
    Glynn, David G.
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 44 : 18 - 21
  • [22] Online Coloring of Bipartite Graphs with and without Advice
    Bianchi, Maria Paola
    Boeckenhauer, Hans-Joachim
    Hromkovic, Juraj
    Keller, Lucia
    ALGORITHMICA, 2014, 70 (01) : 92 - 111
  • [23] The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw
    Ponomarenko, Ilia
    Ryabov, Grigory
    GRAPHS AND COMBINATORICS, 2021, 37 (03) : 1089 - 1102
  • [24] Complete bipartite graphs without small rainbow subgraphs
    Ma, Zhiqiang
    Mao, Yaping
    Schiermeyer, Ingo
    Wei, Meiqin
    DISCRETE APPLIED MATHEMATICS, 2024, 346 : 248 - 262
  • [25] Clique immersion in graphs without a fixed bipartite graph
    Liu, Hong
    Wang, Guanghui
    Yang, Donglei
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2022, 157 : 346 - 365
  • [26] EXPLOITING THE STRUCTURE OF BIPARTITE GRAPHS FOR ALGEBRAIC AND SPECTRAL GRAPH THEORY APPLICATIONS
    Kunegis, Jerome
    INTERNET MATHEMATICS, 2015, 11 (03) : 201 - 231
  • [27] Tree decompositions of graphs without large bipartite holes
    Kim, Jaehoon
    Kim, Younjin
    Liu, Hong
    RANDOM STRUCTURES & ALGORITHMS, 2020, 57 (01) : 150 - 168
  • [28] Spanning trees in graphs without large bipartite holes
    Han, Jie
    Hu, Jie
    Ping, Lidan
    Wang, Guanghui
    Wang, Yi
    Yang, Donglei
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (03) : 270 - 285
  • [29] Graphs without short odd cycles are nearly bipartite
    Gyori, E
    Kostochka, AV
    Luczak, T
    DISCRETE MATHEMATICS, 1997, 163 (1-3) : 279 - 284
  • [30] Maximum bipartite subgraphs in graphs without short cycles
    Lin, Jing
    Zeng, Qinghou
    DISCRETE APPLIED MATHEMATICS, 2022, 311 : 18 - 25