Results 71 to 80 of about 55,019 (192)
Fractional List Packing for Layered Graphs
Journal of Graph Theory, Volume 113, Issue 1, Page 19-37, September 2026.ABSTRACT The fractional list packing number χ ℓ • ( G ) of a graph G is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N need to be to ensure the existence of a “perfectly balanced” probability distribution on proper L‐colourings, that is, such ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Largest Common Subgraph of Two Forests
Journal of Graph Algorithms and ApplicationsA common subgraph of two graphs $G_1$ and $G_2$ is a graph that is isomorphic to subgraphs of $G_1$ and $G_2$. In the largest common subgraph problem the task is to determine a common subgraph for two given graphs $G_1$ and $G_2$ that is of maximum ...
Dieter Rautenbach, Florian Werner
doaj +1 more source
Acylindrical visual splittings and the Tits alternative for Artin groups
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract We give a necessary and sufficient condition on a visual splitting of an Artin group satisfying the conclusions of two well‐known conjectures to be acylindrical, and demonstrate how this can be used to provide a large class of novel examples of Artin groups that satisfy the Tits alternative.
William D. Cohen
wiley +1 more source
Cartwright–Sturmfels Hilbert schemes
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.Abstract Let S$S$ be the Cox ring of a product of r$r$ projective spaces. In this paper, we study the Cartwright–Sturmfels Hilbert schemes of S$S$, which are multigraded Hilbert schemes that parameterize only radical ideals. Our main result shows that these Hilbert schemes are always smooth and irreducible if the Picard rank r$r$ is at most 2.
Ritvik Ramkumar, Alessio Sammartano
wiley +1 more source
SEGCN: a subgraph encoding based graph convolutional network model for social bot detection
Scientific ReportsMessage passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test ...
Feng Liu +5 more
doaj +1 more source
Interpolation categories for conformal embeddings
Proceedings of the London Mathematical Society, Volume 133, Issue 3, September 2026.Abstract In this paper, we give a diagrammatic description of the categories of modules coming from the conformal embeddings V(slN,N)⊂V(soN2−1,1)$\mathcal{V}({\mathfrak{sl}}_{N},N)\subset \mathcal{V}({\mathfrak{so}}_{{N}^{2}-1},1)$. A small variant of this construction (morally corresponding to a conformal embedding of glN${\mathfrak{gl}}_{N}$ level N ...
Cain Edie‐Michell, Noah Snyder
wiley +1 more source
Edge-Centric Federated Subgraph Isomorphism Counting via Residual Graph Neural Networks
InformationSubgraph isomorphism counting is a fundamental yet computationally challenging task in graph analysis, with broad applications in bioinformatics and social network mining.
Jianjun Shi, Qinglong Wu, Xinming Zhang
doaj +1 more source
Marked subgraph isomorphism of ordered graphs [PDF]
, 1998 Recently, the concept of ordered graphs has been introduced and it was shown that isomorphism of ordered graphs can be solved in quadratic time. In the present paper we consider a special case of the subgraph isomorphism problem for ordered graphs, called marked subgraph isomorphism.
Xiaoyi Jiang 0001, Horst Bunke
openaire +2 more sources
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source