Splitting cycles in graphs
classification
🧮 math.AC
keywords
cyclesgraphssplittingconditiondescribeedgeexplicitfunction
read the original abstract
The goal of this paper is to describe a sufficient condition on cycles in graphs for which the edge ideal is splittable. We give an explicit splitting function for such ideals.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.