Bipartite Subgraphs of Triangle-Free Graphs
SIAM Journal on Discrete Mathematics
Bipartite subgraphs of integer weighted graphs
Discrete Mathematics
Algorithms with large domination ratio
Journal of Algorithms
MaxCut in ${\bm H)$-Free Graphs
Combinatorics, Probability and Computing
Edge Distribution of Graphs with Few Copies of a Given Graph
Combinatorics, Probability and Computing
Approximating Maximum Subgraphs without Short Cycles
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Judicious k-partitions of graphs
Journal of Combinatorial Theory Series B
On several partitioning problems of Bollobás and Scott
Journal of Combinatorial Theory Series B
On the small cycle transversal of planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Approximating Maximum Subgraphs without Short Cycles
SIAM Journal on Discrete Mathematics
On the small cycle transversal of planar graphs
Theoretical Computer Science
Partitioning 3-uniform hypergraphs
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We consider the bipartite cut and the judicious partition problems in graphs of girth at least 4. For the bipartite cut problem we show that every graph G with m edges, whose shortest cycle has length at least r≥4, has a bipartite subgraph with at least /m2; + c(r)mr/r+1 edges. The order of the error term in this result is shown to be optimal for r = 5 thus settling a special case of a conjecture of Erdös. (The result and its optimality for another special case, r = 4, were already known.) For judicious partitions, we prove a general result as follows: if a graph G = (V, E) with m edges has a bipartite cut of size /m2; + δ, then there exists a partition V = V1 ∪ V2 such that both parts V1, V2 span at most /m4; - (1 - o(1))/δ2; + O(√m) edges for the case δ = o(m), and at most (1/4-Ω(1))m edges for δ = Ω(m). This enables one to extend results for the bipartite cut problem to the corresponding ones for judicious partitioning.