BIPARTITE SUBGRAPHS OF H-FREE GRAPHS

被引：10

作者：

Zeng, Qinghou ^{[1
]}

Hou, Jianfeng ^{[1
]}

机构：

[1] Fuzhou Univ, Ctr Discrete Math, Fuzhou 350003, Fujian, Peoples R China

来源：

BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2017年 / 96卷 / 01期

关键词：

H-free graph; partition; bipartite subgraph; INDEPENDENCE NUMBER; BOUNDS;

D O I：

10.1017/S0004972716001295

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For a graph G, let f (G) denote the maximum number of edges in a bipartite subgraph of G. For an integer m and for a fixed graph H, let f (m, H) denote the minimum possible cardinality of f (G) as G ranges over all graphs on m edges that contain no copy of H. We give a general lower bound for f (m, H) which extends a result of Erdos and Lovasz and we study this function for any bipartite graph H with maximum degree at most t >= 2 on one side.

引用

页码：1 / 13

页数：13

共 50 条

[1] MAXIMUM BIPARTITE SUBGRAPHS IN H-FREE GRAPHS
Lin, Jing
[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2022, 72 (03) : 621 - 635
[2] Maximum bipartite subgraphs in H-free graphs
Jing Lin
[J]. Czechoslovak Mathematical Journal, 2022, 72 : 621 - 635
[3] Many cliques in H-free subgraphs of random graphs
Alon, Noga
Kostochka, Alexandr
Shikhelman, Clara
[J]. JOURNAL OF COMBINATORICS, 2018, 9 (04) : 567 - 597
[4] Disjoint paths and connected subgraphs for H-free graphs
Kern, Walter
Martin, Barnaby
Paulusma, Daniel
Smith, Siani
van Leeuwen, Erik Jan
[J]. THEORETICAL COMPUTER SCIENCE, 2022, 898 : 59 - 68
[5] Disjoint Paths and Connected Subgraphs for H-Free Graphs
Kern, Walter
Martin, Barnaby
Paulusma, Daniel
Smith, Siani
van Leeuwen, Erik Jan
[J]. COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 414 - 427
[6] On-line coloring of H-free bipartite graphs
Broersma, H. J.
Capponi, A.
Paulusma, D.
[J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 284 - 295
[7] Long paths and cycles in random subgraphs of H-free graphs
Krivelevich, Michael
Samotij, Wojciech
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
[8] Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Barnaby Martin
Daniël Paulusma
Siani Smith
Erik Jan van Leeuwen
[J]. Algorithmica, 2023, 85 : 2580 - 2604
[9] Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Martin, Barnaby
Paulusma, Daniël
Smith, Siani
van Leeuwen, Erik Jan
[J]. arXiv, 2022,
[10] Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Martin, Barnaby
Paulusma, Daniel
Smith, Siani
van Leeuwen, Erik Jan
[J]. ALGORITHMICA, 2023, 85 (09) : 2580 - 2604

← 1 2 3 4 5 →