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 条
  • [21] Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
    Koana, Tomohiro
    Komusiewicz, Christian
    Sommer, Frank
    ALGORITHMICA, 2023, 85 (07) : 2156 - 2187
  • [22] Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
    Saha, Barna
    Hoch, Allison
    Khuller, Samir
    Raschid, Louiqa
    Zhang, Xiao-Ning
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2010, 6044 : 456 - +
  • [23] Random Dense Bipartite Graphs and Directed Graphs With Specified Degrees
    Greenhill, Catherine
    McKay, Brendan D.
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (02) : 222 - 249
  • [24] Decomposing dense bipartite graphs into 4-cycles
    Cavenagh, Nicholas J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [25] DENSE EXPANDERS AND PSEUDO-RANDOM BIPARTITE GRAPHS
    THOMASON, A
    DISCRETE MATHEMATICS, 1989, 75 (1-3) : 381 - 386
  • [26] Rainbow spanning trees in random subgraphs of dense regular graphs
    Bradshaw, Peter
    DISCRETE MATHEMATICS, 2024, 347 (06)
  • [27] Almost-spanning subgraphs with bounded degree in dense graphs
    Ishigami, Y
    EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (05) : 583 - 612
  • [28] Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs
    Kang, Dong Yeap
    COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (03): : 423 - 464
  • [29] Mining Highly Reliable Dense Subgraphs from Uncertain Graphs
    Lu Yihong
    Huang Ruizhi
    Huang Decai
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2019, 13 (06): : 2986 - 2999
  • [30] Efficient testing of bipartite graphs for forbidden induced subgraphs
    Alon, Noga
    Fischer, Eldar
    Newman, Ilan
    SIAM JOURNAL ON COMPUTING, 2007, 37 (03) : 959 - 976
12345