Results 101 to 110 of about 1,222,002 (199)
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.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
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, Volume 113, Issue 4, Page 619-633, December 2026.ABSTRACT We prove that for every t ∈ N there exists τ = τ ( t ) ∈ N such that every (theta, prism, K 1 , t)‐free graph has tree independence number at most τ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
The Plant Phenome Journal, Volume 9, Issue 1, December 2026.Abstract Lodging in sorghum (Sorghum bicolor (L.) Moench) presents a significant challenge for plant breeders due to the trade‐off between lodging resistance and grain yield. Manually measuring lodging across thousands of plots is time‐consuming, expensive, and error‐prone, making selection for lodging resistance challenging in breeding programs ...
Srinivasa Reddy Mothukuri +8 more
wiley +1 more source
Perfect Circle's Plant in Richmond, Indiana
, 1940 Luvena Dethridge sang in concerts while holding various jobs. After working at Reid Memorial Hospital as a cook, laundress, and maid, she worked as a piston inspector for the Perfect Circle plant in Richmond in the 1940s. A contract for a concert in 1945
Perfect Circle Company
core
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, Volume 113, Issue 3, Page 462-469, November 2026.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
Magnetic Resonance in Medicine, Volume 96, Issue 5, Page 2489-2504, November 2026.ABSTRACT Purpose To improve the accuracy of diffusion‐weighted powder average signals for diffusion encoding with arbitrary b‐tensors. Methods We identify an intrinsic dihedral (D2) symmetry of diffusion signals for arbitrary diffusion encoding, which defines their natural signal space (a quotient of 3D rotations). Based on this, we propose a method to
Sune Nørhøj Jespersen +1 more
wiley +1 more source
Confidence Intervals for a Proportion Estimated From Pooled Samples Based on Firth's Corrected Score
Biometrical Journal, Volume 68, Issue 5, October 2026.ABSTRACT Interval estimation of a proportion estimated from testing of pooled samples has been studied by a variety of researchers, who have examined both exact and asymptotic methods. Recent work in point estimation has seen the use of Firth's correction to maximum likelihood estimation to reduce bias effectively. We consider the Firth‐corrected score
Brad J. Biggerstaff, Graham Hepworth
wiley +1 more source
European Journal of Sport Science, Volume 26, Issue 10, October 2026.ABSTRACT We aimed to examine: (i) measurement agreement between photoelectric cell system and manual stopwatch timing; (ii) inter‐rater agreement between trained and untrained raters using manual stopwatch timing; and (iii) reliability of the 6‐m gait speed test to assess motor fitness in adults, according to sex, age, and physical activity levels. 410
José Castro‐Piñero +6 more
wiley +1 more source
, 1995 The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite perfect graphs. A graph G is perfect if G and each of its induced subgraphs have the property that the chromatic number is equal to the clique number ...
Lim, Yvette F.
core