Results 71 to 80 of about 446,387 (282)
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
A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3
, 2020 Based on the famous Rotation-Extension technique, by creating the new concepts and methods: broad cycle, main segment, useful cut and insert, destroying edges for a main segment, main goal Hamilton cycle, depth-first search tree, we develop a polynomial ...
Du, Lizhi
core
Long‐Term Hydrophilic, Anti‐Clotting, and Anti‐Fibrotic Dynamic Covalent Silicone‐Based Biomaterials
Advanced Healthcare Materials, EarlyView.Dynamic covalent crosslinking of a Schiff‐base silicone elastomer with hydrazide‐functionalized polymers is demonstrated to improve the long‐term hydrophilicity as well as the anti‐fouling and anti‐clotting properties of PDMS implants. The hydrazone‐functionalized material prevents hydrophobic recovery, resists clotting, and significantly reduces ...
Norma A. Garza Flores +12 more
wiley +1 more source
Dating the business cycle: Evidence from Mongolia
Central Bank Review, 2019 Business cycle is an important indicator for making policy and management decisions. This paper compares the business cycle estimates for Mongolia based on a graphical and parametric methods.
Davaajargal Luvsannyam +2 more
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
Heavy and Light Paths and Hamilton Cycles
SSRN Electronic Journal, 2022 Given a graph $G$, we denote by $f(G,u_0,k)$ the number of paths of length $k$ in $G$ starting from $u_0$. In graphs of maximum degree 3, with edge weights $i.i.d.$ with $exp(1)$, we provide a simple proof showing that (under the assumption that $f(G,u_0,k)=ω(1)$) the expected weight of the heaviest path of length $k$ in $G$ starting from $u_0$ is at ...
Sahar Diskin, Dor Elboim
openaire +2 more sources
Azaporphyrinoid‐Based Photo‐ and Electroactive Architectures for Advanced Functional Materials
Advanced Materials, EarlyView.A long‐standing collaboration between the Torres and Guldi groups has yielded diverse azaporphyrinoid‐based donor‐acceptor nanohybrids with promising applications in solar energy conversion. This conspectus highlights key molecular platforms and structure‐function relationships that govern light and charge management, supporting the rational design of ...
Jorge Labella +3 more
wiley +1 more source
Have Business Cycles Become More Synchronous After NAFTA?
American Business Review, 2021 Trade agreements do not necessitate business cycle comovement. Focusing on NAFTA, we investigate whether business cycles in Canada, Mexico, and the US have become more synchronous after the landmark trade agreement came into effect in 1994.
Puneet Vatsa
doaj +1 more source
Counting Hamilton cycles in sparse random directed graphs
, 2018 Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\ge(\log n+\omega(1))/n$ then D(n,p) typically has a directed Hamilton
Alon book N. +7 more
core +1 more source
Rainbow Hamilton cycles and lopsidependency
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. A. Harvey, Christopher Liaw
openaire +1 more source