Finding bipartite subgraphs efficiently

DOI10.1016/J.IPL.2009.11.015zbMATH Open1197.05150arXiv0905.2527OpenAlexW1979173413MaRDI QIDQ991744FDOQ991744

Authors: Dhruv Mubayi, Gy. Turán 

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $mge3n^{3/2}$, find a complete balanced bipartite subgraph with parts about $lnn/(ln(n^2/m))$, given a graph with $n$ vertices, find a decomposition of its edges into complete balanced bipartite graphs having altogether $O(n^2/lnn)$ vertices. Previous proofs of the existence of such objects, due to KH{o}v'ari-S'os-Tur'an, Chung-ErdH{o}s-Spencer, Bublitz and Tuza were non-constructive.

Full work available at URL: https://arxiv.org/abs/0905.2527

Recommendations

• Bipartite subgraphs
• Linear-Time Approximation Algorithms for the Max Cut Problem
• On the number of maximal bipartite subgraphs of a graph
• scientific article; zbMATH DE number 1339492
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three

zbMATH Keywords

algorithmsbipartite graphextremal graph theorygraph algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Cites Work

• On the Addressing Problem for Loop Switching
• Title not available (Why is that?)
• On a problem of K. Zarankiewicz
• Decomposition of graphs and monotone formula size of homogeneous functions
• Title not available (Why is that?)
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Title not available (Why is that?)
• The Algorithmic Aspects of the Regularity Lemma
• Title not available (Why is that?)
• Disproving the Single Level Conjecture

Cited In (9)

• Title not available (Why is that?)
• On the number of maximal bipartite subgraphs of a graph
• Title not available (Why is that?)
• Succinct posets
• An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
• Title not available (Why is that?)
• Finding even subgraphs even faster
• Title not available (Why is that?)
• Maximum bipartite subgraphs of Kneser graphs

This page was built for publication: Finding bipartite subgraphs efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991744)