Results 71 to 80 of about 1,024 (103)

Pathogenic de novo variants in PPP2R5C cause a neurodevelopmental disorder within the Houge-Janssens syndrome spectrum. [PDF]

Am J Hum Genet
Verbinnen I, Douzgou Houge S, Hsieh TC, Lesmann H, Kirchhoff A, Geneviève D, Brimble E, Lenaerts L, Haesen D, Levy RJ, Thevenon J, Faivre L, Marco E, Chong JX, Bamshad M, Patterson K, Mirzaa GM, Foss K, Dobyns W, White SM, Pais L, O'Heir E, Itzikowitz R, Donald KA, Van der Merwe C, Mussa A, Cervini R, Giorgio E, Roscioli T, Dias KR, Evans CA, Brown NJ, Ruiz A, Trujillo Quintero JP, Rabin R, Pappas J, Yuan H, Lachlan K, Thomas S, Devlin A, Wright M, Martin R, Karwowska J, Posmyk R, Chatron N, Stark Z, Heath O, Delatycki M, Buchert R, Korenke GC, Ramsey K, Narayanan V, Grange DK, Weisenberg JL, Haack TB, Karch S, Kipkemoi P, Mangi M, Bindels de Heus KGCB, de Wit MY, Barakat TS, Lim D, Van Winckel G, Spillmann RC, Shashi V, Jacob M, Stehr AM, Undiagnosed Diseases Network, Krawitz P, Douzgos Houge G, Janssens V.   +70 more
europepmc   +1 more source

The Connectional Diaschisis and Normalization of Cortical Language Network Dynamics After Basal Ganglia and Thalamus Stroke. [PDF]

Neurobiol Lang (Camb)
Chen Q, Guo X, Zhong T, Yang J, Gao X, Hu Z, Li J, Liu J, Wang Y, Qu Z, Li W, Li Z, Li W, Huang Y, Chen J, Wen H, Zhang Y, Yuan B, Gao H.   +18 more
europepmc   +1 more source

Annual Research Review: The role of caregiver sensitivity in children's developmental outcomes - an umbrella review. [PDF]

J Child Psychol Psychiatry
Nivison MD, Fearon P, Jenkins JM, Madigan S.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Rainbow Generalizations of Ramsey Theory: A Survey

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujita, Shinya, Magnant, Colton, Ozeki, Kenta   +2 more
openaire   +4 more sources

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

Networks, 1974
AbstractA Proper graph G has no isolated points. Its Ramsey number r(G) is the minimum p such that every 2‐coloring of the edges of Kp contains a monochromatic G. The Ramsey multiplicity R(G) is the minimum number of monochromatic G in any 2‐coloring of Kr(G). With just one exception, namely K4, we determine R(G) for proper graphs with at most 4 points.
Harary, Frank, Prins, G.
openaire   +4 more sources

An application of the regularity lemma in generalized Ramsey theory

Journal of Graph Theory, 2003
AbstractGiven graphs G and H, an edge coloring of G is called an (H,q)‐coloring if the edges of every copy of H ⊂ G together receive at least q colors. Let r(G,H,q) denote the minimum number of colors in a (H,q)‐coloring of G. In 9 Erdős and Gyárfás studied r(Kn,Kp,q) if p and q are fixed and n tends to infinity.
Sárközy, Gábor N., Selkow, Stanley M.
openaire   +3 more sources

Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph

Bulletin of the London Mathematical Society, 1974
Harary, Frank, Hell, Pavol
openaire   +3 more sources

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks

Networks, 1978
AbstractRamsey problems are examined for the different varieties of graphs and digraphs, with and without loops and multiple edges, and even for networks. In every case, the resulting Ramsey number either fails to exist, or has a trivial value, or equals the value for the underlying graph or digraph.
Harary, Frank, Schwenk, A. J.
openaire   +1 more source