Results 71 to 80 of about 21,615 (266)
Negative learning emotions and learning goal orientation in teams: HRD implications
Human Resource Development Quarterly, Volume 36, Issue 1, Page 49-67, Spring 2025.Abstract Utilizing insights from team regulation theory and social cognitive theory, this research conducted empirical testing through a field survey involving engineering teams. This research is significant as it inspires teams to effectively harness their learning capacity, thereby enhancing collective motivation for future success.
Kuang‐Jung Chen +3 more
wiley +1 more source
Singular Ramsey and Turán numbers
Theory and Applications of Graphs, 2019 We say that a subgraph F of a graph G is singular if the degrees d_G(v) are all equal or all distinct for the vertices v of F. The singular Ramsey number Rs(F) is the smallest positive integer n such that, for every m at least n, in every edge 2-coloring
Yair Caro, Zsolt Tuza
doaj +1 more source
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Household Consumption Intentions by Income Group During Monetary Policy Easing and Tightening
International Journal of Finance &Economics, EarlyView.ABSTRACT We investigate how the monetary policy interest rate affects Brazilian households' consumption intentions under two distinct regimes: monetary easing and tightening cycles. Using data from low‐ and high‐income households, we assess both the magnitude and the dynamics of this relationship.
Helder Ferreira de Mendonça +1 more
wiley +1 more source
Gallai-Ramsey number of an 8-cycle
AKCE International Journal of Graphs and Combinatorics, 2020 Given graphs G and H and a positive integer k, the Gallai-Ramsey number is the minimum integer N such that for any integer every k-edge-coloring of Kn contains either a rainbow copy of G or a monochromatic copy of H.
Jonathan Gregory +2 more
doaj +1 more source
Discrete Mathematics, 1999 In classical Ramsey literature usually Ramsey numbers for complete graphs are studied, and it is asked how large they can be. Since Ramsey numbers are monotone functions in the edges of the excluded graphs, one can also investigate the other end, and ask how small a nontrivial Ramsey number of a graph on \(n\) vertices can be.
Csákány, Rita, Komlós, János
openaire +1 more source
Journal of Addictions &Offender Counseling, EarlyView.ABSTRACT This article examines the current landscape of clinical supervision in addiction treatment and proposes a blended supervision framework integrating developmental, competency‐based, and trauma‐informed approaches. The article explores how this integrated model can enhance clinical competence, ethical practice, and counselor resilience while ...
Cyrus Williams +2 more
wiley +1 more source
Journal of Clinical Psychology, EarlyView.ABSTRACT Dialectical behavior therapy (DBT) has shown efficacy in reducing suicidality, though less is known about its effectiveness when delivered in usual care (UC) settings, where the resource‐intensive nature of the program often results in modifications during implementation.
Colleen A. Maxwell +5 more
wiley +1 more source
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heiko Harborth, Meinhard Möller
openaire +2 more sources
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source