Results 71 to 80 of about 7,928 (143)
Eurasian Journal of Medicine, 2010 Objective: Ischemia and reperfusion injury due to tourniquet application during arthroscopy is a well known problem. This study aimed to compare the effects of dexmedetomidine and ketamine on hemodynamic and respiratory variables and on total anti ...
Senem Koruk +6 more
doaj
Frank Ramsey's Anti-Intellectualism
Journal for the History of Analytical PhilosophyFrank Ramsey’s philosophy, developed in the 1920s in Cambridge, was in conversation with the debates surrounding intellectualism in the early twentieth century. Ramsey made his mark on the anti-intellectualist tradition via his notion of habit.
Soroush Marouzi
doaj
Monochromatic graph decompositions inspired by anti-Ramsey colorings
Discrete Applied Mathematics23 ...
Yair Caro, Zsolt Tuza
openaire +2 more sources
Anti-Ramsey number of intersecting cliques
An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $
Lu, Hongliang, Luo, Xinyue, Ma, Xinxin
openaire +2 more sources
Anti-Ramsey Number of Friendship Graphs
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. For a given positive integer $n$ and a family of graphs $\mathcal{G}$, the anti-Ramsey number $ar(n, \mathcal{G})$ is the smallest number of colors $r$ required to ensure that, no matter how the edges of the complete graph $K_n$ are colored using exactly
Liu, Wenke, Lu, Hongliang, Luo, Xinyue
openaire +2 more sources
We say that a graph $G$ is anti-Ramsey for a graph $H$ if any proper edge-colouring of $G$ yields a rainbow copy of $H$, i.e. a copy of $H$ whose edges all receive different colours. In this work we determine the threshold at which the binomial random graph becomes anti-Ramsey for any fixed graph $H$, given that $H$ is sufficiently dense.
openaire +2 more sources
Anti-Ramsey numbers in complete split graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Perspective on Understanding Transient Stimulated Raman Scattering Spectroscopy with Ramsey Interferometry. [PDF]
Chem Biomed ImagingHuang Y, Li Y, Li N, Wang P.
europepmc +1 more source
A novel RHD allele combining partial D (c.455A>C) and weak D (c.1154G>C) variants. [PDF]
TransfusionRamsey G +6 more
europepmc +1 more source
Navigating the Decision to Discontinue Intravitreal Injection Therapy in End-Stage Neovascular Age-Related Macular Degeneration. [PDF]
J Pers MedBennie J, Ramsey DJ.
europepmc +1 more source