BIPARTITE SUBGRAPHS OF -FREE GRAPHS
2017 ◽
Vol 96
(1)
◽
pp. 1-13
◽
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 Erdős and Lovász and we study this function for any bipartite graph $H$ with maximum degree at most $t\geq 2$ on one side.
Keyword(s):
2018 ◽
Vol 10
(05)
◽
pp. 1850069
Keyword(s):
2017 ◽
Vol 17
(03n04)
◽
pp. 1741003
1999 ◽
Vol Vol. 3 no. 4
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 3
(4)
◽
pp. 695-708
◽
Keyword(s):