Results 141 to 150 of about 85,296 (298)
Viral spill‐over from honey bees is a potential threat to wild pollinators. We used causal modelling approaches to detect the main drivers of spill‐over. Honey bee viral density, niche overlap with honey bees, urbanisation and plant‐pollinator network structure all played an important role in the transmission of BQCV, DWV‐A and DWV‐B.
Willem Proesmans +24 more
wiley +1 more source
Conserved spatial patterning of gene expression in independent lineages of C4 plants
Summary C4 photosynthesis enhances carbon fixation efficiency by reducing photorespiration through the use of an oxygen‐insensitive carboxylase and spatial separation of photosynthesis between mesophyll and bundle sheath cells. The C4 pathway has evolved independently in > 60 plant lineages, but molecular mechanisms underpinning this convergence remain
Tianshu Sun +4 more
wiley +1 more source
Topological Ramsey Theorem for Complete Bipartite Graphs
An embedding of a graph into a space is linear if each edge is a straight line segment. In 1991, \textit{S. Negami} [Trans. Am. Math. Soc. 324, No. 2, 527-541 (1991; Zbl 0721.57004)] showed that for any given knot, link, or spatial graph there is a sufficiently large complete graph \(K_ n\) such that every linear embedding of \(K_ n\) into a space ...
openaire +1 more source
ABSTRACT Receptor‐like kinases (RLKs) detect external and internal signals, triggering responses essential for growth and adaptation. Among internal cues, cell wall integrity (CWI) sensing plays a key role, as changes in cell wall structure activate responses critical for development and defense.
Demetrio Marcianò +4 more
wiley +1 more source
Right-angled Artin groups on path graphs, cycle graphs and complete bipartite graphs
Eon-Kyung Lee, Sangjin Lee
openalex +2 more sources
Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +1 more source
Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m,n}(m<n) [PDF]
Chen Xiang-en, Yuping Gao, Bing Yao
openalex +1 more source
Partitioning Complete Bipartite Graphs by Monochromatic Cycles
For every positive integer \(r\) there exists a constant \(C_r\) depending only on \(r\) such that for every colouring of the edges of the complete bipartite graph \(K^{n,n}\) with \(r\) colours, there exists a set of at most \(C_r\) monochromatic cycles whose vertex sets partition the vertex set of \(K^{n,n}\).
openaire +1 more source
In this article, the first eccentricity connectivity coindex is introduced as ECI¯G=∑uv∉EGε2u+ε2v, in which ε(u) denotes the eccentricity of the vertex u in the simple connected graph G. Then, the exact expressions are obtained for the first eccentricity connectivity coindex of some graph products.
Suha Wazzan +2 more
wiley +1 more source
Generalized Tur\'an problems for complete bipartite graphs [PDF]
Dániel Gerbner, Balázs Patkós
openalex +1 more source

