Results 51 to 60 of about 23,139 (195)

Longest cycles in vertex‐transitive and highly connected graphs

Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.
Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan   +4 more
wiley   +1 more source

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos   +3 more
wiley   +1 more source

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

IEEE Access
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan   +5 more
doaj   +1 more source

Prosoluble subgroups of the profinite completion of the fundamental group of compact 3‐manifolds

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract We give a description of finitely generated prosoluble subgroups of the profinite completion of 3‐manifold groups and toral relatively hyperbolic virtually compact special groups.
Lucas C. Lopes, Pavel A. Zalesskii
wiley   +1 more source

The conjugacy problem for ascending HNN‐extensions of free groups

Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We give an algorithm to solve the Conjugacy Problem for ascending HNN‐extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
Alan D. Logan
wiley   +1 more source

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh, Domagoj Bradač, Bernard Lidický   +2 more
wiley   +1 more source

Network Evolution With Mesoscopic Delays

Random Structures &Algorithms, Volume 67, Issue 2, September 2025.
ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic ...
Sayan Banerjee, Shankar Bhamidi, Partha S Dey, Akshay Sakanaveeti   +3 more
wiley   +1 more source

On the universal pairing for 2‐complexes

Bulletin of the London Mathematical Society, Volume 57, Issue 9, Page 2838-2853, September 2025.
Abstract The universal pairing for manifolds was defined and shown to lack positivity in dimension 4 in [Freedman, Kitaev, Nayak, Slingerland, Walker, and Wang, J. Geom. Topol. 9 (2005), 2303–2317]. We prove an analogous result for 2‐complexes, and show that the universal pairing does not detect the difference between simple homotopy equivalence and 3 ...
Mikhail Khovanov, Vyacheslav Krushkal, John Nicholson   +2 more
wiley   +1 more source

A Sharper Ramsey Theorem for Constrained Drawings

Journal of Graph Theory, Volume 109, Issue 4, Page 401-411, August 2025.
ABSTRACT Given a graph G and a collection C of subsets of R d indexed by the subsets of vertices of G, a constrained drawing of G is a drawing where each edge is drawn inside some set from C, in such a way that nonadjacent edges are drawn in sets with disjoint indices. In this paper we prove a Ramsey‐type result for such drawings.
Pavel Paták
wiley   +1 more source

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source