The graphical biclosed ornamentation lattice conjecture
Statement
For a finite undirected graph , let be the graphical pointed building set of , and let denote the subposet of biclosed ornamentations in . Graphical biclosed ornamentation lattice conjecture. The poset
is a lattice. The claim is motivated by several natural examples in which this poset is a lattice, while the paper notes that it is not a lattice for arbitrary pointed building sets; whether the graphical case always has this property 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.