Bean–Tannock–Ulfarsson purity conjecture for boundary-grid downcore graphs
Statement
Let be a -avoiding permutation, and let its boundary grid be the associated skew Young diagram. The downcore graph has the boxes of the boundary grid as vertices, with an edge between and when either and , or and , and both opposite-corner boxes and lie in the skew Young diagram. A graph is pure if every maximal independent set has the same size. Bean–Tannock–Ulfarsson's purity conjecture. The downcore graph of the boundary grid of is pure if and only if avoids . This conjecture concerns a structural characterization of -avoiding permutations through their boundary-grid graphs; the supplied text gives no resolution, so its status remains open.
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.