Cograph cotree lower-bound conjecture
Cograph cotree lower-bound conjecture
Let be a cograph, and let be the tree obtained from its cotree by erasing the leaves. Cograph cotree lower-bound conjecture.
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
Sign in to submit a solution.
No solutions have been posted yet.