In this paper we investigate the behaviour of weighted maximal operators Marcinkiewicz type (C,?)-means ??,* p (f) := supn?P |??n(f)|/ n2/p?(2+?) in Hardy space Hp(G2) (0 < ? 1 and 2/(2 + ?)). It is showed that are bounded from dyadic to Lebesgue Lp(G2), a sense sharp. was also proved strong convergence theorem for (C, ?) means Walsh-Fourier series Hp(G2).

Bilkent University, Department of Chemistr fen.bilkent.edu.tr Abant İzzet Baysal University, Department National Institute of Fundamental Studie Lanka † Electronic supplementary information G2-LiCl-2, G2-LiBr-2, G2-LiI-2, and G2-L pattern of mesocrystals of G2-LiI–I2-4, UV is 1, 2, 3, 4, and 5) and LiI–I2 mixture in Raman spectra of G2-LiI-2 and G2-LiI–I2See DOI: 10.1039/c6ra19979h Cite this: R...

The problem of determining Ramsey numbers is known to be very difficult. The few known exact values and several bounds for different G1, G2 or m, n are scattered among many technical papers (see [3]). A graph G with order p is called a (G1,G2; p)-graph ((m, n; p)-graph, resp.) if G does not contain a G1 and Ḡ does not contain a G2 (Km and Kn , resp.). It is easy to see that R(G1,G2) = p0 +1 iff...

CD8+ T cells that coexpress the inhibitory NK cell receptor, Ly49G2 (G2), are present in immunologically naive C57BL/6 mice but display Ags found on memory T cells. To assess how G2+CD8+ cells relate to bona fide memory cells, we examined the origin and fate of lymphocytic choriomeningitis virus (LCMV)-induced G2+CD8+ cells. During early (day 4) acute LCMV infection, both G2+ and G2-CD8+ T cell...

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets are disjoint. In 1978, Bollobás and Eldridge, and independently Catlin, conjectured that if (∆(G1)+1)(∆(G2)+1)≤ n+1, then G1 and G2 pack. Towards this conjecture, we show that for ∆(G1),∆(G2)≥ 300, if (∆(G1)+1)(∆(G2)+1)≤0.6n+1, then G1 and G2 pack. This is ...

The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of G− F for any F ⊂ V (G) with |F | < k. Krishnamoorthy and Krishnamurthy first proposed this concept and gave Dκ(G1)+κ(G2)(G1 ×G2) Dκ(G1)(G1)+ Dκ(G2)(G2) when κ(G1 ×G2)= κ(G1)+ κ(G2), where κ(G) is the connectivity of G. This paper gives a counterexample to this bound and establishes Dk1+k2(G1 × G2) Dk1(G1) +Dk2 ...

Two graphs G1 and G2, each on n vertices, pack if there exists a bijection f from V (G1) onto V (G2) such that uv ∈ E(G1) only if f (u)f (v) ∉ E(G2). In 2014, Alon and Yuster proved that, for sufficiently large n, if |E(G1)| < n − δ(G2) and ∆(G2) ≤ √ n/200, then G1 and G2 pack. In this paper, we characterize the pairs of graphs for which the theorem of Alon and Yuster is sharp.We also prove the...