On vertex decomposability and regularity of graphs
Abstract
There are two motivation questions in MTS, MTS1 about Castelnuovo-Mumford regularity and vertex decomposable of simple graph G. In this paper, we disprove the questions by providing of two counterexamples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.