Bipartite sandwiches: bounding the size of a maximum biclique
Dmitrii V. Pasechnik
TL;DR
This paper investigates bounds on the size of maximum bicliques in bipartite graphs, aiming to establish theoretical limits and properties.
Contribution
It introduces new bounds and techniques for analyzing the size of maximum bicliques in bipartite graphs.
Findings
Bounds on maximum biclique size proposed
Theorems 1.2 and 1.3 remain unproven due to proof errors
Methodological advancements in bipartite graph analysis
Abstract
Paper withdrawn, due a crucial error in the proof of Lemma 4.3: thus Theorems 1.2 and 1.3 remain unproven.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · graph theory and CDMA systems · Advanced Graph Theory Research