Results 201 to 210 of about 617,805 (269)
Journal of Neuroendocrinology, Volume 38, Issue 10, October 2026.Abstract A recent study showed that female medaka lacking the estrogen receptor gene esr2b are unreceptive to male courtship and instead court other females. In this study, we investigated the brain transcriptome of esr2b‐deficient females to explore the underlying mechanisms of this behavioral phenotype, and identified npyb, one of the two ...
Yuki Homan +9 more
wiley +1 more source
THE INDEX OF A SPECIAL BIPARTITE GRAPH
, 2015 The Harary index of a graph is de¯ned as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in the class of all connected n-vertex bipartite graphs with a given ...
Xu, Feng, Chu, Jing, Zhou, Xiaona
core
Natural Variation in GmSL20 Improves Seed Size and Quality in Soybean
Plant Biotechnology Journal, Volume 24, Issue 10, Page 5300-5316, October 2026.ABSTRACT Seed size plays an important role in determining crop yield, yet the genetic mechanisms underlying the regulation of this agronomic trait remain incompletely understood in soybean. Here, we perform a genome‐wide association study mapping with seed length variations and identify a major quantitative trait locus (QTL) on chromosome 20, named ...
Yuechuan Luo +12 more
wiley +1 more source
Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle-Infrastructure Systems. [PDF]
Sensors (Basel), 2017 Tang X, Hong D, Chen W.
europepmc +1 more source
New discretised polynomial expander and incidence estimates
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We present two applications of recent developments in incidence geometry. One is a δ$\delta$‐discretised version of a particular ‘Elekes–Rónyai’ expander problem. The second is an incidence estimate addressing the scenario in which both tubes, squares and their shadings satisfy non‐concentration assumptions.
Ciprian Demeter, William O'Regan
wiley +1 more source
A tropical version of Martens' theorem for metric graphs
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We study the conjecture stated by Jensen and Len on a tropical version on Martens' theorem via the Brill–Noether rank of a tropical curve. We recall Coppens' counterexample of Martens‐special chain of cycles, and we generalize the construction defining another class of graphs, Martens‐special trees of cycles, for which the conjecture does not ...
Giusi Capobianco, Angelina Zheng
wiley +1 more source
Improved Super-Resolution Ultrasound Microvessel Imaging With Spatiotemporal Nonlocal Means Filtering and Bipartite Graph-Based Microbubble Tracking. [PDF]
IEEE Trans Ultrason Ferroelectr Freq Control, 2018 Song P +6 more
europepmc +1 more source
No‐(k+1)$(k+1)$‐in‐line problem for large constant k$k$
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract How many points can be placed in an n×n$n\times n$ grid so that every (affine) line contains at most k$k$ points? We prove that for n⩾k⩾1037$n \geqslant k \geqslant 10^{37}$ the maximum number of points is exactly kn$kn$. Our proof builds on the recent work of Kovács, Nagy and Szabó (who proved an analogous result when k$k$ is at least about ...
Alexandr Grebennikov, Matthew Kwan
wiley +1 more source
Matchings: Source, goal, and faithful companion
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new mathematical tools that went well beyond problems directly concerning matchings. These tools proved widely applicable, accompanying the growth of graph theory over the past century.
András Sebő
wiley +1 more source
Simonovits's theorem in random graphs
Proceedings of the London Mathematical Society, Volume 133, Issue 4, October 2026.Abstract Let H$H$ be a graph with χ(H)=r+1$\chi (H) = r+1$. Simonovits's theorem states that, if H$H$ is edge‐critical, the unique largest H$H$‐free subgraph of Kn$K_n$ is its largest r$r$‐partite subgraph, provided that n$n$ is sufficiently large. We show that the same holds with Kn$K_n$ replaced by the binomial random graph Gn,p$G_{n,p}$ whenever H$H$
Ilay Hoshen, Wojciech Samotij
wiley +1 more source