نتایج جستجو برای: graph 2k2
تعداد نتایج: 198018 فیلتر نتایج به سال:
We study the removable singularities for solutions to the Beltrami equation ∂f = μ∂f , where μ is a bounded function, ‖μ‖∞ ≤ K−1 K+1 < 1, and such that μ ∈ W 1,p for some p ≤ 2. Our results are based on an extended version of the well known Weyl’s lemma, asserting that distributional solutions are actually true solutions. Our main result is that quasiconformal mappings with compactly supported ...
Strictly Chordality-k graphs (SCk) are which either cycle-free or every induced cycle is of length exactly $$$k, k \geq 3$$$. chordality-3 and strictly chordality-4 (...)
Embedded computational hardware has become prevalent in recent years for communications signal processing for reasons including size and cost. The availability of competing processor architectures from vendors allows a high degree of choice for communications system designers, and some traditional processor vendors have targeted this market aggressively. However whilst one particular computatio...
For a configuration S of n points in the plane, let gk(S) denote the number of subsets of cardinality <k cut off by a line. Let gk, " =max{gk(S): (SI =n}. Good-man and Pollack (J. Combin. Theory Ser. A 36 (1984), 101-104) showed that if k < n/2 then g,,, < 2nk-2k2-k. Here we show that g,, " = k. n for k <n/2. Let S be a finite set of points in the plane. Following Goodman and Pollack [GP2] we c...
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
Let G = G(n) be a graph on n vertices with maximum degree ∆ = ∆(n). Assign to each vertex v of G a list L(v) of colors by choosing each list independently and uniformly at random from all k-subsets of a color set C of size σ = σ(n). Such a list assignment is called a random (k, C)-list assignment. In this paper, we are interested in determining the asymptotic probability (as n → ∞) of the exist...
Motivated by a problem of Gallai on (1-1)-transversals of 2-intervals, it was proved by the authors in 1969 that if the edges of a complete graph K are colored with red and blue (both colors can appear on an edge) so that there is no monochromatic induced C4 and C5 then the vertices of K can be partitioned into a red and a blue clique. Aharoni, Berger, Chudnovsky and Ziani recently strengthened...
NON-COMMUTATIVE REPRESENTATIONS OF FAMILIES OF k2 COMMUTATIVE POLYNOMIALS IN 2k2 COMMUTING VARIABLES
For simple graphs G and H, their size Ramsey number is the smallest possible of F such that for any red-blue coloring its edges, contains either a red or blue H. Similarly, we can define connected by adding prerequisite must be connected. In this paper, explore relationships between these numbers give some results on values certain classes graphs. We are mainly interested in cases where 2K2 3K2...
[1] We examine the ozone production efficiency in transpacific Asian pollution plumes, and the implications for ozone air quality in California, by using aircraft and surface observations in April–May 2002 from the Intercontinental Transport and Chemical Transformation 2002 (ITCT 2K2) campaign off the California coast and the Pacific Exploration of Asian Continental Emission–B (PEACE-B) campaig...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید