Results 1 to 10 of about 33,816 (262)
Safety and efficacy of zuranolone in Japanese adults with major depressive disorder: An open‐label, repeated‐treatment part of a Phase 3 clinical trial [PDF]
Aim To evaluate the safety and tolerability of repeating 14‐day treatment with zuranolone (30 mg) followed by a 6‐week follow‐up period (one treatment cycle) for a maximum of six treatment cycles in Japanese participants with major depressive disorder ...
Masaki Kato +8 more
doaj +2 more sources
Improvement in avoidance in major depressive disorder: A 10‐month prospective study of depressive symptoms and personality traits [PDF]
Aim Avoidance is a key maintaining factor in major depressive disorder (MDD); however, longitudinal evidence remains limited, and its association with personality traits is not fully understood.
Ryotaro Higuchi +9 more
doaj +2 more sources
Multicoloured Hamilton Cycles [PDF]
The edges of the complete graph $K_n$ are coloured so that no colour appears more than $\lceil cn\rceil$ times, where $c < 1/32$ is a constant. We show that if $n$ is sufficiently large then there is a Hamiltonian cycle in which each edge is a different colour, thereby proving a 1986 conjecture of Hahn and Thomassen. We prove a similar result for
Albert, Michael +2 more
openaire +2 more sources
Matchings and Hamilton cycles in hypergraphs [PDF]
It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
Deformation and damage capacity of thin–walled rods and tubular conduits under alternating loading [PDF]
The paper presents deformation and elastoplastic calculation of thin–walled rods (pipelines) under spatial – alternating loading taking into account damageability of material.
Abdusattarov Abdusamat +2 more
doaj +1 more source
Edge Disjoint Hamilton Cycles in Knödel Graphs [PDF]
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
Finding Hamilton cycles in random intersection graphs [PDF]
The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
Packing Hamilton Cycles Online [PDF]
It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge-disjoint Hamilton cycles [4, 9, 13]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ⩾ 2, if random edges of Kn are presented one by one then w.h.p.
Briggs, Joseph +4 more
openaire +4 more sources
Resilience for loose Hamilton cycles
We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with its dense analogue whenever $p \geq n^{- (k-1)/2+o(1)}$.
Alvarado, José D. +4 more
openaire +2 more sources
Have Business Cycles Become More Synchronous After NAFTA?
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

