Aharoni–Lovász strong-perfectness conjecture for perfect graphs with finite independent sets
Statement
Let be a graph such that every induced finite subgraph is perfect; call such a graph perfect in the source's infinite-graph sense. Call strongly perfect if every induced subgraph has a partition into independent sets and a clique meeting every member of that partition.
Aharoni–Lovász conjecture. Every perfect graph in which all independent sets are finite is strongly perfect.
The source presents this as a more general conjecture of which the fish bone conjecture is a special case. It cites the result as known in the literature, but the supplied text does not state whether the conjecture itself has been solved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.