نتایج جستجو برای: we develop a ramsey
تعداد نتایج: 13727325 فیلتر نتایج به سال:
to explore the idea the investingation proposed, aimed at finding whether the performances of the population of iranians students studying english in an efl context are consistent in l1 and l2 writing taks and whether there is a cross-linguistic transfer in this respect. in this regard the subjects were instructed to write four compositions-two in english and two in farsi-which consisted of an ...
for two given graphs g1 and g2, the ramseynumber r(g1,g2) is the smallest integer n such that for anygraph g of order n, either $g$ contains g1 or the complementof g contains g2. let tn denote a tree of order n andwm a wheel of order m+1. to the best of our knowledge, only r(tn,wm) with small wheels are known.in this paper, we show that r(tn,wm)=3n-2 for odd m with n>756m^{10}.
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
?it is of utmost priority for an experienced teacher to train the mind of the students, and enable them to think critically and correctly. the most important question here is that how to develop such a crucial ability? this study examines a new way to the development of critical thinking utilizing critical discourse analytical tools. to attain this goal, two classes of senior english la...
We consider a hypergraph generalization of a conjecture of Burr and Erdős concerning the Ramsey number of graphs with bounded degree. It was shown by Chvátal, Rödl, Trotter, and Szemerédi [The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), no. 3, 239–243] that the Ramsey number R(G) of a graph G of bounded maximum degree is linear in |V (G)|. We derive...
We present one novel result and two novel proofs of previously known results in structural Ramsey theory. For the former, we give a new characterization of the Ramsey property for a Fraïssé class in terms colorings of induced substructures of its generic model (or Fraïssé limit). This result is obtained as a corollary of a more general theorem in which we show that under relatively mild hypothe...
In earlier publications, we had argued that Paul Ramsey is inconsistent because he simultaneously asserts that (i) 'all our days and years are of equal worth' and (ii) 'that it is permissible to refrain from prolonging the lives of some dying patients'. Thomas Long has suggested that we have not shown that Paul Ramsey is inconsistent. Ramsey and we, he holds, start from incommensurable metaphys...
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number R(4, 3, 3) = 30. The number R(4, 3, 3) is often presented as the unknown Ramsey number with the best chances of being found “soon”. Yet, its precise value has remained unknown for more ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H ′ are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H ′. In this paper, we study the problem of determining which graphs are Ramsey-equivalent to the complete graph Kk. A famous theorem of Nešetřil and Rödl implies that any graph H which ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید