Tight Cumulative Bounds for Maximal Induced Bicliques Under Edge Insertions
Year: 2026
Type: preprint
Abstract: Under edge insertions, a maximal induced biclique can lose maximality and later regain it. We prove that, over all edge-insertion orders on n vertices, both the total number of births of maximal induced bicliques, counted with multiplicity, and the number of distinct maximal induced bicliques encountered are Θ(n·3n/3). This improves the bound obtained by applying the static extremal estimate to each insertion by a factor of n. The proof combines local maximal-independent-set encodings with a rigidity argument for Seidel-switching certificates. We also give a polynomial-space algorithm that reports exactly the changes caused by a single insertion in O(n4(λ+1)) time, where λ is the number of bicliques created or destroyed.
Source: Preprints.org
Author: Mohamed Jiddou
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234491752
