A face of a plane bipartite graph is alternating with respect to a perfect matching if its boundary is a cycle whose edges alternate between matched and unmatched edges. The Fries number is the maximum number of alternating bounded faces over all perfect matchings. The Clar number is the maximum number of pairwise vertex-disjoint alternating bounded faces for a single perfect matching (Bérczi-Kovács and Frank 2024).
Orden (2026) reports a counterexample to the claim that every maximum Clar set is contained in the alternating faces of a Fries-optimal perfect matching. In the grid graph of an 11-square polyomino, the unique Fries-optimal perfect matching has eight alternating faces, of which at most four are pairwise vertex-disjoint. The Clar number is five. Two enumerations written by Claude agents checked all 116 perfect matchings, and the author provides a public checker. The work is under journal review. The example uses square faces, leaving the corresponding question for benzenoids open.