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 条

[31] On Finding Dense Subgraphs
Khuller, Samir
Saha, Barna
AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 597 - 608
[32] MAXIMUM WEIGHTED INDUCED BIPARTITE SUBGRAPHS AND ACYCLIC SUBGRAPHS OF PLANAR CUBIC GRAPHS
Baiou, Mourad
Barahona, Francisco
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (02) : 1290 - 1301
[33] Complete r-partite subgraphs of dense r-graphs
Nikiforov, Vladimir
DISCRETE MATHEMATICS, 2009, 309 (13) : 4326 - 4331
[34] Spanning 3-colourable subgraphs of small bandwidth in dense graphs
Boettcher, Julia
Schacht, Mathias
Taraz, Anusch
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (04) : 752 - 777
[35] A result on large induced subgraphs with prescribed residues in bipartite graphs
Hunter, Zach
ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01):
[36] Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
Levinas, Itay
Louzoun, Yoram
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 75 : 541 - 568
[37] Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
Levinas I.
Louzoun Y.
Journal of Artificial Intelligence Research, 2022, 75 : 541 - 568
[38] DENSE BIPARTITE DIGRAPHS
FIOL, MA
YEBRA, JLA
JOURNAL OF GRAPH THEORY, 1990, 14 (06) : 687 - 700
[39] Dense Subgraphs on Dynamic Networks
Das Sarma, Atish
Lall, Ashwin
Nanongkai, Danupon
Trehan, Amitabh
DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 151 - 165
[40] Complexity of finding dense subgraphs
Asahiro, Y
Hassin, R
Iwama, K
DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 15 - 26

← 1 2 3 4 5 →