Sharp bound for cliques becoming maximal during edge insertion

Prove whether at most O(3^{h/3}) cliques of an h-vertex graph can be maximal at the moment their last edge is inserted in an arbitrary one-by-one edge-addition sequence.

Background

For a fixed end time and anchor, the enumeration procedure examines cliques in a sequence of graphs obtained by adding edges. The paper gives an O(h2 3{h/3}) upper bound on the number of cliques that become maximal precisely when their last edge appears. Establishing the sharper O(3{h/3}) bound would remove the factor k2 from the paper’s degeneracy-based bound on the number of maximal link-stream cliques. Computational experiments reported in the paper found no insertion sequence exceeding approximately 3.5·3{h/3} for h at most 12, but this does not resolve the question.

References

This raises the following question. How many cliques of an $h$-order graph can be maximal at the moment their last edge appears, when the edges are added one by one? This number is $O(h23{h/3})$, and a bound $O(3{h/3})$ would remove the factor $k2$ from Theorem~\ref{thm:degeneracy-count}.

— Tight bounds and output sensitive algorithms for maximal clique enumeration in link streams  (2610.11385 - Manoussakis, 8 Oct 2026) in Section 7, Concluding remarks