Abstract Providing optimal conditions for early-life gas bladder inflation of captive fish is one the biggest challenges in culture. It also applies to laboratory fishes. Turquoise killifish ( Nothobranchius furzeri Jubb, 1971) a popular research model biogerontology due its short lifespan. Annual culture frequently suffer from an inability inflate their which may stem suboptimal environmental ...

We describe a new species of marsupial frog, genus Gastrotheca , using morphological characters and molecular data as lines evidence. The was discovered in the páramo ecotone between humid montane forest Cordillera de Colán, at elevations 3136 3179 m a.s.l., northeastern Peru. is distinguished from all its congeners by combination following characters: coarsely granular skin on dorsum, green do...

One way to state the Load Coloring Problem (LCP) is as follows. Let G = (V,E) be graph and let f : V → {red,blue} be a 2-coloring. An edge e ∈ E is called red (blue) if both end-vertices of e are red (blue). For a 2-coloring f , let r′ f and b′f be the number of red and blue edges and let μf (G) = min{r ′ f , b ′ f}. Let μ(G) be the maximum of μf (G) over all 2-colorings. We introduce the param...

The Ramsey number r(H,G) is defined as the minimum N such that for any coloring of the edges of the N -vertex complete graph KN in red and blue, it must contain either a red H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K3, G) ≤ 2q + 1 where G has q edges. In other words, any graph on 2q + 1 vertices with independence number at most 2 contains every (iso...

As usual, for graphs Γ, G, and H, we write Γ → (G,H) to mean that any red-blue colouring of the edges of Γ contains a red copy of G or a blue copy of H. A pair of graphs (G,H) is said to be Ramsey-infinite if there are infinitely many minimal graphs Γ for which we have Γ → (G,H). Let ` ≥ 4 be an integer. We show that if H is a 2connected graph that does not contain induced cycles of length at l...

For graphs $G$ and $H$, the Ramsey number $R(G,H)$ is minimum integer $N$ such that any red/blue edge coloring of $K_N$ contains either a red or blue $H$. Let $G+H$ be graph obtained from vertex disjoint $H$ by adding new edges connecting completely, $F_m=K_1+mK_2$ $B_p(n)=K_p+nK_1$. It shown $R(F_m,B_p(n))=2(n+p-1)+1$ for fixed $m, p$ large $n$.

In this study, bimodal mesoporous silica, i.e. UVM-7, was synthesized and functionalized withsulfonic acid and characterized using XRD, nitrogen physisorption, SEM, TEM and acid/basetitration. The results displayed that bimodal mesopore structure was firmly formed and acidicfunctional groups were grafted on the surface of the UVM-7. The concentration of the acidicfunctional groups was determine...

Let χc(H) denote the circular chromatic number of a graph H. For graphs F and G, the circular chromatic Ramsey number Rχc(F,G) is the infimum of χc(H) over graphs H such that every red/blue edge-coloring of H contains a red copy of F or a blue copy of G. We characterize Rχc(F,G) in terms of a Ramsey problem for the families of homomorphic images of F and G. Letting zk = 3 − 2 −k, we prove that ...