For a graph F , we say that another G is -saturated, if -free and adding any edge to would create copy of . We study for given integer n whether there exists regular -vertex -saturated graph, it does, what the smallest number edges such graph. mainly focus on case when complete prove example K 3 vertices every large enough also two relaxed versions problem: only require no supergraph should exi...

For a graph H, G is H-induced-saturated if does not contain an induced copy of but either removing arbitrary edge from or adding non-edge to creates H. Depending on the necessarily exist. In fact, (Martin and Smith, 2012) showed that P4-induced-saturated graphs do exist, where Pk denotes path k vertices. Given it easy construct Pk-induced-saturated for k?{2,3}, (Axenovich Csikós, 2019) asked wh...

Patients with sickle cell disease usually have mild hypoxaemia and their oxyhaemoglobin dissociation curve is shifted to the right. It follows that oxygen saturation in sickle cell disease should be lower than normal. Most subjects in this clinic had normal oxygen saturation by pulse oximetry, however. To improve the understanding of this paradox, arterialised capillary oxygen tension (PO2) and...

Saturation discrimination has been reported to be affected early in the course of a disease. Our empirical data show a compressive curvi-linear relationship between opponent/nonopponent channel activity and saturation thresholds in normal trichromatic observers. This relationship can be explained by a model based on the Hurvich and Jameson saturation coefficient (1957), Psychology Reviews, 64, ...