Abstract An [a, b]-factor of a graph G is a spanning subgraph H such that a≤ d H (v)≤ b for
each v∈ V (G). In this paper, we provide spectral conditions for the existence of an odd [1, b] …

A factor of a graph is a spanning subgraph satisfying some given conditions. An earlier
survey of factors can be traced back to the Akiyama and Kano [J. Graph Theory, 1985, 9: 1 …

If a graph has a unique perfect matching, we call it a UPM-graph. In this paper we study
UPM-graphs. It was shown by Kotzig that a connected UPM-graph has a cut edge belonging …

Colorings, matchings, and packings are three important topics in the field of graph theory.
Random graphs allow us to understand which properties of graphs hold for typical graphs in …

Following the article “On the maximum number of edges in a k-uniform hypergraph with a
unique perfect matching” by Deepak Bal, Andrzej Dudek, and Zelealem B. Yilma, this paper …