نتایج جستجو برای: turan
تعداد نتایج: 384 فیلتر نتایج به سال:
Ismayil YILMAZ 1, Ismail DEMIRYILMAZ 2, Mehmet I. TURAN 3*, Bahadır SULEYMAN 4, Isil S. TURAN 5, Durdu ALTUNER 4, Hamit H. ALP 6 & Halis SULEYMAN 4 1 Erzincan University, Faculty of Medicine, Department of Surgery, Erzincan, Turkey 2 Ibni Sina Hospital, Department of General Surgery, Kayseri, Turkey 3 Diyarbakir Research and Educational Hospital, Department of Pediatric Neurology, Diyarbakir, T...
The Turan number of a graph G is the maximum number of edges in a graph on n vertices that does not contain G. For graphs G with χ(G) = r, a celebrated theorem of Erdős and Stone [2] states that the Turan number of G is ( r−2 r−1 + o (1) ) ( n 2 ) . For bipartite graphs, this result only tell us that the Turan number is o (n). The 3-dimensional cube Q is the graph with vertex set {0, 1} where t...
For an /-uniform hypergraph 3and an integer n, the Turan number ex(n, F) for F on n vertices is denned to be the maximum size \Q\ of a hypergraph Q C [n] not containing a copy of F C2\ as a subhypergraph. For 1 = 1 and f = Kk , the complete graph on k vertices, these numbers were determined by P. Turan. However, for I > 2, and nearly any hypergraph F, the Turan problem of determining the number...
Prehospital Intubation: Further Confounders in Trial Results Iqbal Sayeed, Fahim Atif, Claudia Espinosa-Garcia, Bushra Wali, Nefize Turan, Seema Yousuf & Donald G. Stein To cite this article: Iqbal Sayeed, Fahim Atif, Claudia Espinosa-Garcia, Bushra Wali, Nefize Turan, Seema Yousuf & Donald G. Stein (2018): Prehospital Intubation: Further Confounders in Trial Results, Prehospital Emergency Care...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید