نتایج جستجو برای: we develop a ramsey

تعداد نتایج: 13727325  

Djoko Suprijanto Edy Tri Baskoro Hilda Assiyatun, Kristiana Wijaya, Lyra Yulianti

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1390

we commence by using from a new norm on l1(g) the -algebra of all integrable functions on locally compact group g, to make the c-algebra c(g). consequently, we find its dual b(g), which is a banach algebra so-called fourier-stieltjes algebra, in the set of all continuous functions on g. we consider most of important basic theorems about this algebra. this consideration leads to a rather com...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ولی عصر (عج) - رفسنجان - دانشکده ریاضی 1392

let h be a separable hilbert space and let b be the set of bessel sequences in h. by using several interesting results in operator theory we study some topological properties of frames and riesz bases by constructing a banach space structure on b. the convergence of a sequence of elements in b is de_ned and we determine whether important properties of the sequence is preserved under the con...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1375

this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1377

chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید چمران اهواز 1390

abstract:assume that y is a banach space such that r(y ) ? 2, where r(.) is garc?a-falset’s coefficient. and x is a banach space which can be continuously embedded in y . we prove that x can be renormed to satisfy the weak fixed point property (w-fpp). on the other hand, assume that k is a scattered compact topological space such that k(!) = ? ; and c(k) is the space of all real continuous ...

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تحصیلات تکمیلی علوم پایه زنجان - دانشکده فیزیک 1392

in the first part of this thesis we explored wetting and its dynamics for small droplets. first, we showed how a simple feature of water droplets on a surface, i.e. laplace pressure, can be exploited to build a micropump. we investigated capillary pumping in microchannels both experimentally and numerically. putting two droplets of different sizes at the in/outlet of a microchannel, will ge...

Journal: :journal of algorithms and computation 0
alex f. collins rochester institute of technology, school of mathematical sciences, rochester, ny 14623 alexander w. n. riasanovsky university of pennsylvania, department of mathematics, philadelphia, pa 19104, usa john c. wallace trinity college, department of mathematics, hartford, ct 06106, usa stanis law p. radziszowski rochester institute of technology, department of computer science, rochester, ny 14623

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید