نتایج جستجو برای: we develop a ramsey
تعداد نتایج: 13727325 فیلتر نتایج به سال:
abstract the present study is concerned with the syntactic deviation in hafezs poetry. poems are known to be accompanied with various linguistic deviations. these deviations may be phonological, morphological and/or syntactic. the relatively high frequency of the cases of the syntactic deviation in hafezs poems makes this rhetorical feature as a main characteristic of his poetry. this thesis, ...
With regard to importance of investment as an engine of economic growth many economists such as Wicksel, Keynse and Harrod believe that investment is the main source of business cycles. Hence this study specifies investment function according to a basic macroeconomic model such as Ramsey model. Application of Ramsey model can help to extend macroeconomics with micro foundations in economy of I...
We consider a \Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games.
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some result concerning both Ramsey saturated and unsaturated graph. In particular, we show that a cycle Cn and a Jahangir Jm Ramsey unsaturated or saturated graphs of R(Cn,Wm) and R(Pn, Jm), respectively. We also suggest an open problems.
Augmentative and alternative communication (AAC) methods are used to support people who have communication problems. Attempts have been made to apply AAC to assist the communication of people with cognitive impairments, including people with dementia. Two systems, CIRCA and Talking Mats, took as their starting points different types of communication situation which are problematic with dementia...
abstract this study examines the relationship between reading anxiety and difficulty of texts as well as the relationship between reading anxiety and students perceived difficulty of the texts. since difficulty is a relative concept, i limited its definition by sticking to the readability formula. we also took students perceived difficulty levels into account. therefore, in the present study, ...
Several recent essays are presented on the difficulties scientific research and science researchers have by now been facing for a number of decades due to what goes by the name of ”science management”. Gun Fodder for Science Management ? 0. Develop or Die, and the Role of ”Type I” Research in Science ... It is customary to use the term ”Knowledge Society” for describing the present state of hum...
We give a lower bound for the Ramsey number and the planar Ramsey number for C4 and complete graphs. We prove that the Ramsey number for C4 and K7 is 21 or 22. Moreover we prove that the planar Ramsey number for C4 and K6 is equal to 17.
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees. Galois connections between partial orders are used in formulating this theorem, while the abstract approach to Ramsey theory,...
This paper continues the study of the Ramsey-like large cardinals introduced in [Git09] and [WS08]. Ramsey-like cardinals are defined by generalizing the “existence of elementary embeddings” characterization of Ramsey cardinals. A cardinal κ is Ramsey if and only if every subset of κ can be put into a κ-size transitive model of ZFC for which there exists a weakly amenable countably complete ult...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید