Results 171 to 180 of about 24,841 (222)
JCPP Advances, EarlyView.Abstract Background Previous studies have reported differences in levels of mental wellbeing between autistic and non‐autistic adolescents and between girls and boys. However, it is unclear to what extent being autistic or a particular gender influences mental wellbeing in adolescence. The importance of social relationships for mental wellbeing is well
Ellie Roberts, Eirini Flouri, Will Mandy
wiley +1 more source
The double-edged sword of internet use in China's aging population: thresholds, mediation and digital health policy. [PDF]
Front Public HealthLi Y, Cai J, Yu H.
europepmc +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn +3 more
wiley +1 more source
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, EarlyView.ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan +5 more
wiley +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source
Long Induced Paths in K s , s ${K}_{s,s}$‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s ${K}_{s,s}$‐free graph containing an n $n$‐vertex path must contain an induced path of length f ( n ) $f(n)$, where f ( n ) → ∞ $f(n)\to \infty $ as n → ∞ $n\to \infty $. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 /
Zach Hunter +3 more
wiley +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source