BIPARTITE SUBGRAPHS OF TRIANGLE-FREE GRAPHS

被引:31
|
作者
POLJAK, S [1 ]
TUZA, Z [1 ]
机构
[1] HUNGARIAN ACAD SCI,INST COMP & AUTOMAT,H-1111 BUDAPEST,HUNGARY
关键词
TRIANGLE-FREE GRAPH; MAXIMUM BIPARTITE SUBGRAPH; POLYNOMIAL-TIME ALGORITHM;
D O I
10.1137/S0895480191196824
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The authors present a lower bound on the maximum size of a bipartite subgraph of a triangle-free graph that improves a result due to Erdos and Lovasz. It also gives a polynomial-time algorithm, while the previous bound was proved by probabilistic methods.
引用
收藏
页码:307 / 313
页数:7
相关论文
共 50 条
  • [1] A NOTE ON BIPARTITE SUBGRAPHS OF TRIANGLE-FREE GRAPHS
    SHEARER, JB
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (02) : 223 - 226
  • [3] A NOTE ON BIPARTITE SUBGRAPHS OF TRIANGLE-FREE REGULAR GRAPHS
    LOCKE, SC
    [J]. JOURNAL OF GRAPH THEORY, 1990, 14 (02) : 181 - 185
  • [4] Dense Induced Bipartite Subgraphs in Triangle-Free Graphs
    Kwan, Matthew
    Letzter, Shoham
    Sudakov, Benny
    Tuan Tran
    [J]. COMBINATORICA, 2020, 40 (02) : 283 - 305
  • [5] Dense Induced Bipartite Subgraphs in Triangle-Free Graphs
    Matthew Kwan
    Shoham Letzter
    Benny Sudakov
    Tuan Tran
    [J]. Combinatorica, 2020, 40 : 283 - 305
  • [6] EXTREMAL BIPARTITE SUBGRAPHS OF CUBIC TRIANGLE-FREE GRAPHS
    HOPKINS, G
    STATON, W
    [J]. JOURNAL OF GRAPH THEORY, 1982, 6 (02) : 115 - 121
  • [7] Maximum bipartite subgraphs of cubic triangle-free planar graphs
    Cui, Qing
    Wang, Jian
    [J]. DISCRETE MATHEMATICS, 2009, 309 (05) : 1091 - 1111
  • [8] LARGEST BIPARTITE SUBGRAPHS IN TRIANGLE-FREE GRAPHS WITH MAXIMUM DEGREE 3
    BONDY, JA
    LOCKE, SC
    [J]. JOURNAL OF GRAPH THEORY, 1986, 10 (04) : 477 - 504
  • [9] Triangle-Free Subgraphs of Random Graphs
    Allen, Peter
    Bottcher, Julia
    Kohayakawa, Yoshiharu
    Roberts, Barnaby
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (02): : 141 - 161
  • [10] Triangle-free graphs and forbidden subgraphs
    Brandt, S
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 25 - 33