DENSE INDUCED SUBGRAPHS OF DENSE BIPARTITE GRAPHS

被引：2
|
作者：
McCarty, Rose [1 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON, Canada
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2021年 / 35卷 / 02期
关键词：
average-degree; girth; induced subgraphs; INDUCED SUBDIVISIONS;
D O I：
10.1137/20M1370744
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We prove that every bipartite graph of sufficiently large average degree has either a Kt,t-subgraph or an induced subgraph of average degree at least t and girth at least 6. We conjecture that "6" can be replaced by any constant "k," which strengthens a conjecture of Thomassen. In support of this conjecture, we show that it holds for regular graphs.
引用
收藏
页码：661 / 667
页数：7
相关论文
共 50 条
  • [11] Subgraphs of Dense Random Graphs with Specified Degrees
    McKay, Brendan D.
    COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (03): : 413 - 433
  • [12] CONCENTRIC SUBGRAPHS, CLOSED SUBSETS AND DENSE GRAPHS
    KOH, KM
    SAUER, N
    LECTURE NOTES IN MATHEMATICS, 1984, 1073 : 100 - 118
  • [13] Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
    Axenovich, Maria
    Tompkins, Casey
    Weber, Lea
    JOURNAL OF GRAPH THEORY, 2021, 97 (01) : 34 - 46
  • [14] 2-factors in dense bipartite graphs
    Czygrinow, A
    Kierstead, HA
    DISCRETE MATHEMATICS, 2002, 257 (2-3) : 357 - 369
  • [15] Dense subgraphs induced by edge labels
    Kumpulainen, Iiro
    Tatti, Nikolaj
    MACHINE LEARNING, 2024, 113 (04) : 1967 - 1987
  • [16] Dense subgraphs induced by edge labels
    Iiro Kumpulainen
    Nikolaj Tatti
    Machine Learning, 2024, 113 : 1967 - 1987
  • [17] Graphs without a partition into two proportionally dense subgraphs
    Bazgan, Cristina
    Chlebikova, Janka
    Dallard, Clement
    INFORMATION PROCESSING LETTERS, 2020, 155
  • [18] DENSE GRAPHS WITHOUT 3-REGULAR SUBGRAPHS
    PYBER, L
    RODL, V
    SZEMEREDI, E
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) : 41 - 54
  • [19] Embedding spanning subgraphs in uniformly dense and inseparable graphs
    Ebsen, Oliver
    Maesaka, Giulia S.
    Reiher, Christian
    Schacht, Mathias
    Schuelke, Bjarne
    RANDOM STRUCTURES & ALGORITHMS, 2020, 57 (04) : 1077 - 1096
  • [20] Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
    Tomohiro Koana
    Christian Komusiewicz
    Frank Sommer
    Algorithmica, 2023, 85 : 2156 - 2187
12345