Daisy cubes are partial cubes whose vertices can be represented by a down-set of a Boolean lattice. This paper gives a label-free characterization: a finite partial cube is a daisy cube if and only if every Djoković–Winkler -class is peripheral. The proof orients each -class toward a peripheral halfspace and shows that the resulting -coordinate labels are closed downward. The characterization turns recognition into a condition on the halfspace structure and gives an exact obstruction formulation: the minimal forbidden pc-minors for daisy cubes are precisely the pc-minor-minimal partial cubes containing a non-peripheral -class. We also give an infinite product family of such obstructions. For all and , the graph obtained from by deleting the two opposite corners is a minimal forbidden partial cube-minor for the class of daisy cubes.

生成讲解博客的中文版本

生成AI智能校验的中文版本