Flag f-vectors of colored complexes
Andrew Frohmader
TL;DR
This paper investigates the constraints on flag f-vectors of colored complexes, demonstrating that imposing stronger conditions than color-shifting alters their characterization.
Contribution
It reveals that stronger-than-color-shifting conditions cannot be applied without changing the flag f-vector characterization of colored complexes.
Findings
Stronger conditions than color-shifting are incompatible with existing flag f-vector characterizations.
Imposing such conditions would alter the fundamental description of colored complexes.
The study clarifies the limitations of applying additional constraints to colored complexes.
Abstract
It is shown that conditions stronger in a certain sense than color-shifting cannot be placed on the class of colored complexes without changing the characterization of the flag f-vectors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Limits and Structures in Graph Theory