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 条
  • [41] A DECOMPOSITION OF A GRAPH INTO DENSE SUBGRAPHS
    TOIDA, S
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1985, 32 (06): : 583 - 589
  • [42] Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
    Li, Angsheng
    Peng, Pan
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 655 - 665
  • [43] Finding Dynamic Dense Subgraphs
    Rozenshtein, Polina
    Tatti, Nikolaj
    Gionis, Aristides
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2017, 11 (03)
  • [44] SMALL DENSE SUBGRAPHS OF A GRAPH
    Jiang, Tao
    Newman, Andrew
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 124 - 142
  • [45] Criterions for locally dense subgraphs
    Tibely, Gergely
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1831 - 1847
  • [46] On Supermodular Contracts and Dense Subgraphs
    Vuong, Ramiro Deo-Campo
    Dughmi, Shaddin
    Patel, Neel
    Prasad, Aditya
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 109 - 132
  • [47] Finding lasting dense subgraphs
    Konstantinos Semertzidis
    Evaggelia Pitoura
    Evimaria Terzi
    Panayiotis Tsaparas
    Data Mining and Knowledge Discovery, 2019, 33 : 1417 - 1445
  • [48] Finding dense subgraphs efficiently
    Faragó, A
    FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 73 - 79
  • [49] Mining Large Dense Subgraphs
    Srivastava, Ajitesh
    Chelmis, Charalampos
    Prasanna, Viktor K.
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16 COMPANION), 2016, : 111 - 112
  • [50] Dense Subgraphs in Biological Networks
    Hosseinzadeh, Mohammad Mehdi
    SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 711 - 719
12345