A Ridge-Saturation Characterization of $\alpha$-Critical $\mathbf {W}_p$ Graphs
Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu, Kevin Pereyra

TL;DR
This paper provides a comprehensive characterization of $ ext{alpha}$-critical $ extbf{W}_p$ graphs across multiple mathematical frameworks, revealing their structural properties and establishing bounds related to saturation and rigidity.
Contribution
It introduces an exact formula for the maximum $p$ for which a well-covered graph belongs to $ extbf{W}_p$, and clarifies the complement correspondence with explicit saturation-theoretic consequences.
Findings
Characterization in three equivalent languages: graph, independence complex, and complement.
Exact formula for the largest $p$ for well-covered graphs in $ extbf{W}_p$.
Counterexamples to the necessity of a local condition outside the triangle-free case.
Abstract
We characterize the graphs which are simultaneously -critical and members of the class . The characterization is stated in three equivalent languages. In the graph itself, such a graph is a well-covered graph whose codimension-one localization fibers all have size at least and whose edges are exactly covered by the cliques induced by those fibers. In the independence complex, it is a pure flag complex in which every ridge has degree at least and every missing edge is generated by the link of a ridge. In the complement, it is a -saturated graph, where , all maximal cliques have size , and the minimum -clique-codegree is at least . This gives an exact formula for the largest for which a well-covered graph belongs to . We make this complement correspondence explicit, record saturation-theoretic consequences…
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.
