Results 51 to 60 of about 442,994 (288)
PLoS ONE, 2021 Animal experiments have consistently shown that estrogen receptor β (ERβ)-selective ligands have antidepressant and anxiolytic effects. In humans, endogenous ligands for ERβ include 5α-androstane-3β, 17β-diol (3βAdiol) and androstenediol (Δ5-diol).
Haruka Tanabe +6 more
doaj +1 more source
Self‐Refreshing Bi‐Based Active Sites for Efficient and Durable Electrochemical CO2 Reduction
Advanced Functional Materials, EarlyView.A self‐refreshing Bi‐based catalyst is developed through the fabrication of a novel basic bismuth nitrate pre‐catalyst, which exhibits differential active sites of Bi2O2CO3 at low potentials and metallic Bi phases at high potentials, self‐repairing capability, and thus wide‐potential‐window efficiency and ultralong durability toward electrochemical CO2
Yuxuan Xiao +7 more
wiley +1 more source
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj +1 more source
The Curriculum of the Jester: An Examination of Hamilton, An American Musical
Journal of Curriculum Theorizing, 2022 Relying on a curriculum theory and cultural studies lens, this paper examines the Broadway musical Hamilton and asks "What history is it teaching?". Focusing on the cycle of cultural production, the paper further examines the lines of impact the musical
Gabriel Stephen Huddleston
doaj +1 more source
Hamilton $\ell$-Cycles in Randomly Perturbed Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2018 We prove that for integers $2 \leqslant \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly 'perturbed' by changing non-edges to edges independently at random with probability $p \geqslant O(n^{-(k-\ell)-c})$, then with high probability the resulting $k$-uniform hypergraph contains a Hamilton ...
McDowell, Andrew, Mycroft, Richard
openaire +3 more sources
Advanced Functional Materials, EarlyView.Herein, an RBC membrane‐derived nanoparticle (CMN‐ICG) is engineered to efficiently deliver a sonosensitizing agent, indocyanine green (ICG), for sonotherapy of hepatocellular carcinoma (HCC). CMN‐ICG exhibits excellent cytocompatibility, significantly enhances hepatocyte uptake, and produces excessive reactive oxygen species (ROS) upon ultrasound ...
Alap Ali Zahid +6 more
wiley +1 more source
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements ...
Borowiecki Mieczysław, Broere Izak
doaj +1 more source
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source
Packing tight Hamilton cycles in 3-uniform hypergraphs
, 2010 Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1}, v_{i+2}} is an edge ...
Frieze, Alan +2 more
core +5 more sources
k-Ordered Hamilton cycles in digraphs
Journal of Combinatorial Theory, Series B, 2008 Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which encounters these vertices in this order.
Kühn, Daniela +2 more
openaire +2 more sources