Results 141 to 150 of about 35,760 (258)
Partial Steiner Triple Systems With an Almost Parallel Class Missing Any Given Point
Journal of Combinatorial Designs, EarlyView.ABSTRACT We say that a hypergraph is factor critical if it has no 1‐factor but deletion of any vertex results in a hypergraph that has a 1‐factor. We show that any factor‐critical hypergraph of order n $n$ has at least n $n$ edges, and that for all integers k > 1 $k\gt 1$ and n > 1 $n\gt 1$ with n ≡ 1 ( mod k ) $n\equiv 1({\rm{mod}}\,k)$ there exists a
Darryn Bryant +2 more
wiley +1 more source
Alexithymia in Schizophrenia and Psychosis Vulnerability: A Systematic Review and Meta‐Analysis
Journal of Clinical Psychology, Volume 81, Issue 6, Page 410-424, June 2025.ABSTRACT Aims Disturbances involving impairments in experience and expression of affect are frequently identified in schizophrenia samples. Alexithymia underlies cognitive impairments in identification and expression of affect, further implicated in affect dysregulation.
Ercan Ozdemir +3 more
wiley +1 more source
JCPP Advances, EarlyView.Abstract Background Early exposure to maternal depression can increase risk for offspring mental health problems across the lifespan. Less is known about the transdiagnostic pathways through which maternal depression influences offspring mental health risk in young adulthood.
Gabrielle R. Rinne +3 more
wiley +1 more source
JCPP Advances, EarlyView.Abstract Background Young child depressive symptoms are associated with various concurrent and future psychiatric problems, indicating early transdiagnostic risk for psychopathology. We now need studies that identify and test the robustness, reliability, and validity of early emerging depressive symptom dimensions, examining them relative to wide ...
Nicolas L. Camacho +4 more
wiley +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Counting, Cardinality and Conservation in Autistic Children. [PDF]
Autism ResPolo-Blanco I +2 more
europepmc +1 more source
Cardinality heterogeneities in Web service composition: Issues and solutions
, 2008 Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a composition.
MAAMAR, Zakaria +4 more
core
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
Minimal Dispersion on the Sphere. [PDF]
Discrete Comput GeomLitvak AE, Sonnleitner M, Szczepanski T.
europepmc +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source