PURPOSE To evaluate the potential of heavier-than-water brilliant blue G (BBG-D(2) 0) to stain the internal limiting membrane (ILM) during chromovitrectomy. METHODS In a nonrandomized, prospective, clinical multicentre study, 71 consecutive chromovitrectomy interventions in 71 patients were analysed. During routine 23-gauge vitrectomy, conventional 0.25 mg/ml BBG was employed in 21 and 0.25 m...

Excited-state intramolecular proton transfer (ESIPT) is a photophysical process that may lead to superior emission properties. For long time, cinnamoyl pyrone (CP) derivatives have been classified as non-ESIPT molecules. With the exception of those bearing strong electron-donor substituent, they considered no interest from spectroscopic point view, because are virtually not fluorescent in solut...

For two ordered graphs \(G^<\) and \(H^<\), the Ramsey number \(r_<(G^<,H^<)\) is minimum N such that every red-blue coloring of edges complete graph \(K^<_N\) contains a red copy or blue \(H^<\).

Let F ,G be families of graphs. The generalized Ramsey number r(F ,G) denotes the smallest value of n for which every red-blue coloring of Kn yields a red F ∈ F or a blue G ∈ G. Let F(k) be a family of graphs with k vertex-disjoint cycles. In this paper, we deal with the case where F = F(3),G = {Kt} for some fixed t with t > 2, and prove that r(F(3),G) = 2t + 5.

The nonclassical mixed domination Ramsey number v(m,G) is the smallest integer p such that in every 2-coloring of the edges of Kp with color red and blue, either Γ(B) ≥ m or there exists a blue copy of graph G, where B is the subgraph of Kp induced by blue edges. Γ(G) is the maximum cardinality of a minimal dominating set of a graph G. We give exact values for numbers v(m,K3 − e), v(3, Pm), v(3...

Let R and B be two disjoint sets of red points and blue points in the plane, respectively, such that no three points of R ∪ B are collinear, and let a, b and g be positive integers. We show that if ag ≤ |R| < (a + 1)g and bg ≤ |B| < (b + 1)g, then we can subdivide the plane into g convex polygons so that every open convex polygon contains exactly a red points and b blue points and that the rema...