Results 31 to 40 of about 2,293,482 (304)
Asians at Hamilton: The Asian and Asian American Experience
, 2021 This project looks to examine the experiences of Asian and Asian Americans at Hamilton College from a holistic ...
Nguyen-Haberneski, Maya, \u2723 +10 more
core
Powers of Hamilton cycles in pseudorandom graphs [PDF]
Combinatorica, 2014 We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$ with $|X|\ge\varepsilon p^kn$ and $|Y|\ge\varepsilon p^\ell n$ we have $e(X,Y)=(1\pm\varepsilon)p|X||Y|$.
Peter Allen 0001 +4 more
openaire +4 more sources
Edge Disjoint Hamilton Cycles in Knödel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The vertices of the Knödel graph $W_{\Delta, n}$ on $n \geq 2$ vertices, $n$ even, and of maximum degree $\Delta, 1 \leq \Delta \leq \lfloor log_2(n) \rfloor$, are the pairs $(i,j)$ with $i=1,2$ and $0 \leq j \leq \frac{n}{2} -1$.
Palanivel Subramania Nadar Paulraja +1 more
doaj +1 more source
Advanced Functional Materials, EarlyView.A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs [PDF]
Random Structures & Algorithms, 2018 AbstractWe show that for every there exists C > 0 such that if then asymptotically almost surely the random graph contains the kth power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of Kühn and Osthus.
Rajko Nenadov, Nemanja Skoric
openaire +4 more sources
A short proof of the middle levels theorem
Discrete Analysis, 2018 A short proof of the middle-levels theorem, Discrete Analysis 2018:8, 12 pp. Let $n$ be a positive integer, and define a bipartite graph where one vertex set consists of all subsets of $\{1,2,\dots,2n+1\}$ of size $n$, the other consists of all subsets ...
Petr Gregor +2 more
doaj +1 more source
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
Advanced Functional Materials, EarlyView.Schematic illustration of LNP‐MPG nuclei‐targeting delivery of HMW‐FGF2 promoting histone acetylation to regulate the fate of DPSCs and treat spinal cord injury. LNPs components include pHMW‐FGF2 plasmid, DSPC, Dlin‐MC3‐DMA, cholesterol, and PEG2000, and are modified with MPG to form HMW‐FGF2@LNP‐MPG (HLM). HLM nuclei‐targets DPSCs to deliver HMW‐FGF2,
Heng Zhou +6 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Nitride MXenes remain constrained by a persistent gap between computational prediction and experimental realization. This Review identifies the thermodynamic, kinetic, and chemical barriers limiting their synthesis, critically evaluates emerging fabrication routes, and proposes a multidimensional computational‐experimental framework to accelerate the ...
Naresh Varnakavi, Masoud Soroush
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