Exploring foci of:
arxiv.org
Levelable graphs
April 2025 • Kieran Bhaskara, Michael Y. C. Chong, Takayuki Hibi, Naveena Ragunathan, Adam Van Tuyl
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with positive integer values on the vertices of $G$ such that $G$ is well-covered with respect to this weight function. That is, the sum of the weights in any maximal independent set of vertices of $G$ is the same. We describe some of the basic properties of levelable graphs and class…
The Dancers At The End Of Time
Hope Ii
The Ninth Wave
The Bureaucrats (1936 Film)
Main Page
The False Mirror
The Massacre At Chios
Weapons (2025 Film)
Squid Game Season 3
Technological Fix
Harvester Vase
Electronic Colonialism
Victoria Mboko
Lauren Sánchez
Collective Action Problem
Shefali Jariwala
Hackers: Heroes Of The Computer Revolution
Community Fridge
Compassion Fade
F1 (Film)
Takahiro Shiraishi
The Wealth Of Networks
The 1975
This Changes Everything (Book)
Silencing The Past
Direct Action: An Ethnography
Sweet Porridge