Given a graph G = (V, E), a family of nonempty vertex-subsets S ⊆ 2 V , and a weight w : S → R+, the maximum stable set problem with weights on vertex-subsets consists in finding a stable set I of G maximizing the sum of ...

A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching ...

The purpose of this paper is twofold. We introduce a general maximal function on the Gaussian setting which dominates the Ornstein-Uhlenbeck maximal operator and prove its weak type by using a covering lemma which is ...

We study the general formulation of gauged supergravity in seven dimensions with sixteen supercharges keeping duality covariance by means of the embedding tensor formalism. We first classify all inequivalent duality orbits ...

Hamburgers (beef patties) may be adulterated through the overuse of protein extenders. Among vegetables, soy protein is the best substitute for animal protein. These ingredients help to reduce the cost of producing a final ...

Linear impulsively controlled systems are suitable to describe a venue of real-life problems, going from disease treatment to aerospace guidance. The main characteristic of such systems is that they remain uncontrolled for ...

This paper deals with roommate problems (Gale and Shapley, Am Math Mon 69(1):9–15, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs of stable matchings and ...

This paper deals with roommate problems (Gale and Shapley, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study the assortativeness of stable matchings and the size of the core by means ...