A note on graphs with characteristic-dependent well-covered dimension
Joseph Burdick, Oscar Vega

TL;DR
This paper explores graphs whose well-covered dimension varies with the characteristic of the field, providing methods to construct more such graphs from existing examples.
Contribution
It introduces new constructions of graphs with characteristic-dependent well-covered dimension, expanding understanding of their properties.
Findings
Identification of graphs with characteristic-dependent well-covered dimension
Methods to construct additional such graphs from known examples
Insights into how graph properties depend on field characteristics
Abstract
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
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
TopicsFinite Group Theory Research · Rings, Modules, and Algebras · Graph Labeling and Dimension Problems
