A note on extreme sets

Radosław Cymer


In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties. In particular, we prove the generalized Decomposition Theorem and give a characterization for the set of all extreme vertices in a graph.


matching theory, decomposition theory, degree-factors, extreme sets

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2017.5.2.9


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats