Submitted:
13 November 2026
Posted:
16 November 2026
You are already at the latest version
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.
Keywords:
maximal induced bicliques
; edge-insertion filtrations
; extremal bounds
; change-sensitive enumeration
; Seidel switching
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.