[Paper Review] Bipartite sandwiches: bounding the size of a maximum biclique

Dmitrii V. Ṗasechnik|ArXiv.org|Jul 16, 1999

Computational Geometry and Mesh Generation10 references3 citations

TL;DR

This paper proposes a method to bound the size of a maximum biclique in a bipartite graph using a 'bipartite sandwich' framework. Despite introducing novel combinatorial techniques, the work was withdrawn due to a critical error in Lemma 4.3, leaving the main theorems unproven and its key results invalid.

ABSTRACT

Paper withdrawn, due a crucial error in the proof of Lemma 4.3: thus Theorems 1.2 and 1.3 remain unproven.

Motivation & Objective

• To develop a combinatorial framework for bounding the size of a maximum biclique in a bipartite graph.
• To introduce the 'bipartite sandwich' method as a tool for analyzing biclique structures.
• To establish theoretical upper bounds on the maximum biclique size using graph-theoretic and optimization techniques.
• To connect extremal combinatorics with optimization problems in graph theory.
• To provide a foundation for algorithmic and complexity-theoretic analysis of biclique problems.

Proposed method

• Utilizes a sandwiching technique between two bipartite graphs to constrain the size of a maximum biclique.
• Applies combinatorial optimization methods to derive bounds on biclique size using structural properties of bipartite graphs.
• Employs techniques from extremal graph theory and integer programming to model biclique constraints.
• Relies on a key lemma (Lemma 4.3) to derive upper bounds on the maximum biclique size.
• Integrates results from 05C78 (graph theory), 68R10 (discrete structures), and 90C27 (combinatorial optimization).
• Uses LaTeX-based formalism to express bounds and structural constraints in a mathematically rigorous way.

Experimental results

Research questions

• RQ1 Can a sandwiching framework effectively bound the size of a maximum biclique in a bipartite graph?
• RQ2 What combinatorial and optimization techniques can be used to derive non-trivial upper bounds on biclique size?
• RQ3 How do structural properties of bipartite graphs influence the maximum possible biclique size?
• RQ4 To what extent can extremal graph theory and optimization tools be unified in this context?
• RQ5 What role does Lemma 4.3 play in establishing the theoretical bounds claimed in the paper?

Key findings

• The paper claims to establish upper bounds on the size of a maximum biclique using a novel bipartite sandwich framework.
• Theoretical results (Theorems 1.2 and 1.3) were intended to provide tight bounds on maximum biclique size in bipartite graphs.
• The core method relies on a critical lemma (Lemma 4.3) that was later found to contain a crucial error.
• As a result, the main theorems are unproven and the claimed bounds are invalid.
• The paper was officially withdrawn in 2008 due to the fundamental flaw in Lemma 4.3.
• Despite its theoretical ambition, the work's contributions are nullified by the proof error, rendering all key results unsound.