Let H be a fixed graph. We say that graph G is -saturated if it has no subgraph isomorphic to , but the addition of any edge results in an -subgraph. The saturation number sat ( n ) minimum edges on vertices. Kászonyi and Tuza, 1986, gave general upper bound nontrivial lower remained elusive. In this paper we give prove asymptotically sharp (up additive constant) large class graphs. This includ...

OBJECTIVE To determine the effects of temazepam on the quality of sleep and on oxygen saturation during sleep in subjects at high altitude. DESIGN Randomised, blinded, crossover, placebo controlled trial. SETTING Base camp at Mount Everest (altitude 5300 m). SUBJECTS 11 members of British Mount Everest Medical Expedition recently arrived at base camp. INTERVENTION Participants were rand...

the simultaneous flow of oil and water in porous media is described by relative permeability curves, mainly derived from laboratory experiments. relative permeability is of paramount importance in predicting reservoir production performance and drive mechanisms and its value depends largely on the volume fraction of fluids present in the test samples. nowadays x-ray scanners are one of the most...

In the traction system of rolling stock, common-mode (CM) voltage is over 500 V, so inductors that suppress CM current are prone to saturation. To prevent saturation, inverter needs many numbers cores inside inductors, but required number has been determined empirically. This paper proposes a method calculate approximate nanocrystalline avoid saturation in railway inverters without circuit simu...

For a fixed graph F, the minimum number of edges in an edge-maximal F-free subgraph G is called F-saturation number. The asymptotics Erdos–Renyi random G(n, p) for constant \(p\in (0,1)\) was established any complete and star graph. We obtain \(C_m\)-saturation \(m\geqslant 5.\) Also we prove non-trivial linear (in n) lower bounds upper \(C_4\)-saturation some values p.