Uniqueness conjecture for cograph minimal -polar obstructions
Uniqueness conjecture for cograph minimal -polar obstructions
A cograph minimal -polar obstruction is a cograph that is not -polar but whose every proper induced subgraph is -polar; its type records its number of connected components and its number of isolated vertices. For integers satisfying
Uniqueness conjecture. There exists exactly one cograph minimal -polar obstruction of type . This extends the cases for which uniqueness is established and leaves the remaining admissible types to be characterized.
Sources & referencesView supporting material
Primary source
F. Esteban Contreras-Mendoza and César Hernández-Cruz, “Minimal obstructions to (, k)-polarity in cographs”, arXiv:2104.07852 (2021).
Progress summary
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.