Results 121 to 130 of about 21,746 (178)
Mathematical modeling of biomolecular network dynamics. [PDF]
Methods Mol Biol, 2011 Ratushny AV, Ramsey SA, Aitchison JD.
europepmc +1 more source
Killing of VRE Enterococcus faecalis by commensal strains: Evidence for evolution and accumulation of mobile elements in the absence of competition. [PDF]
Gut Microbes, 2016 Gaca AO, Gilmore MS.
europepmc +1 more source
Epigenome-guided analysis of the transcriptome of plaque macrophages during atherosclerosis regression reveals activation of the Wnt signaling pathway. [PDF]
PLoS Genet, 2014 Ramsey SA +7 more
europepmc +1 more source
<i>Drosophila</i> Nrf2/Keap1 Mediated Redox Signaling Supports Synaptic Function and Longevity and Impacts on Circadian Activity. [PDF]
Front Mol Neurosci, 2019 Spiers JG +4 more
europepmc +1 more source
Hydrogel Micro-/Nanosphere Coated by a Lipid Bilayer: Preparation and Microscopic Probing. [PDF]
Gels, 2017 Rahni S, Kazakov S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Bipartite Ramsey numbers of cycles
European Journal of Combinatorics, 2021Given bipartite graphs $H_1$, \dots , $H_k$, the bipartite Ramsey number $br(H_1,\dots, H_k)$ is the minimum integer $N$ such that any $k$-edge-coloring of complete bipartite graph $K_{N, N}$ contains a monochromatic $H_i$ in color $i$ for $1\le i\le k$.
Zilong Yan, Yuejian Peng
semanticscholar +3 more sources
Multicolored Bipartite Ramsey Numbers of Large Cycles
Acta Mathematicae Applicatae Sinica, English Series, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shaojin Liu, Yue-jian Peng
semanticscholar +2 more sources
Graphs and Combinatorics, 1991
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
G. Exoo
semanticscholar +2 more sources
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
G. Exoo
semanticscholar +2 more sources