Results 161 to 170 of about 2,715,030 (252)

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

Using MR-chordless circuits for efficient enumeration of autocatalytic cores in large chemical reaction networks. [PDF]

J Cheminform
Golnik R, Vassena N, Stadler PF, Gatter T, Gatter T.   +4 more
europepmc   +1 more source

Odd-Ramsey numbers of complete bipartite graphs

In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs H in Kn, defined as the minimum number of colours needed to colour the edges of K so that every copy of a graph H E H intersects some colour class in ...
Boyadzhiyska, Simona, Lesgourgues, Thomas, Das, Shagnik, Petrova, Kalina H   +3 more
core   +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

List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. [PDF]

J Comb Optim
Şen BB, Erlebach T, Yaşar Ö.
europepmc   +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

Spectral energies of redefined Zagreb indices and comparative QSPR applications to anticancer and alcohol datasets. [PDF]

Sci Rep
Zeren Y, Çiçek E, Alsharafi M.
europepmc   +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

First Zagreb energy of self-looped graphs: predictive insights into kidney infection drugs and theoretical bounds. [PDF]

Sci Rep
Yashaswini L, Rakshith BR, Nagaraja P.
europepmc   +1 more source