Cograph cotree lower-bound conjecture

Let CC be a cograph, and let T~\widetilde{T} be the tree obtained from its cotree by erasing the leaves. Cograph cotree lower-bound conjecture.

γP(C)E(T~)#{internal vertices of T~ labeled with the join or join operatation}.\gamma_{\mathcal P}(C)\geq |E(\widetilde{T})|-\#\{\text{internal vertices of }\widetilde{T}\text{ labeled with the join or join operatation}\}.

The proposed bound would sharpen the loose lower bound obtained in the paper and would imply structural finiteness results for cographs of bounded algebraic co-rank. Its status is open in the source context.

Sources & referencesView supporting material

Primary source

Carlos A. Alfaro, Hugo Corrales and Carlos E. Valencia, “Critical ideals of signed graphs with twin vertices”, arXiv:1504.06257 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.