We prove that for a connected graph G with maximum degree 3 there exists a bipartite subgraph of G containing almost 3/4 of the edges of G. Furthermore, we completely characterize the set of all extremal graphs, i.e. all connected graphs G = (V, E) with maximum degree 3 for which no bipartite subgraph has more than 3 \E\ - 1/4 of the edges; \E\ denotes the cardinality of E. For 2-edge-connected graphs there are two kinds of extremal graphs which realize the lower bound 3/4 \E\.
机构:
East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R China
Yuan, Long-Tu
Zhang, Xiao-Dong
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Jiao Tong Univ, Sch Math Sci, MOE LSC, SHL MAC, Shanghai 200240, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R China
机构:
Keio Univ, Fac Business & Commerce, Kohoku Ku, Yokohama, Kanagawa 2238521, JapanKeio Univ, Fac Business & Commerce, Kohoku Ku, Yokohama, Kanagawa 2238521, Japan
Fujisawa, Jun
论文数: 引用数:
h-index:
机构:
Nakamoto, Atsuhiro
Ozeki, Kenta
论文数: 0引用数: 0
h-index: 0
机构:
Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
Japan Soc Promot Sci, Tokyo, JapanKeio Univ, Fac Business & Commerce, Kohoku Ku, Yokohama, Kanagawa 2238521, Japan
机构:
Univ Fed Goias, INF, Goiania, Go, Brazil
UFRJ, COPPE Sistemas, Goiania, Go, BrazilUniv Fed Goias, INF, Goiania, Go, Brazil
Coelho, H.
Faria, L.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Estado Rio De Janeiro, DCC, Rio De Janeiro, RJ, BrazilUniv Fed Goias, INF, Goiania, Go, Brazil
Faria, L.
Gravier, S.
论文数: 0引用数: 0
h-index: 0
机构:
UJF, CNRS, Maths Modeler Team, Inst Fourier, St Martin Dheres, FranceUniv Fed Goias, INF, Goiania, Go, Brazil
Gravier, S.
Klein, S.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Rio de Janeiro, IM, Rio de Janeiro, RJ, Brazil
Univ Fed Rio de Janeiro, COPPE Sistemas, Rio de Janeiro, RJ, BrazilUniv Fed Goias, INF, Goiania, Go, Brazil