Results 91 to 100 of about 420,658 (213)
Proper 3‐realizability and second cohomology of groups on two generators of finite order
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract Given an (infinite) finitely generated group G$G$, its first cohomology group H1(G;ZG)$H^1(G;{\mathbb {Z}}G)$ is free abelian and “counts” the number of ends of G$G$ which equals 1+rank(H1(G;ZG))$1 + rank (H^1(G;{\mathbb {Z}}G))$. The question whether or not for every finitely presented group G$G$ its second cohomology group H2(G;ZG)$H^2(G ...
Francisco F. Lasheras, R. Roy
wiley +1 more source
CoRRProceedings of the Third Learning on Graphs Conference (LoG 2024), PMLR 269.
JJ Wilson +2 more
openaire +4 more sources
The Zarankiewicz problem on tripartite graphs
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract In 1975, Bollobás, Erdős, and Szemerédi asked for the smallest τ$\tau$ such that an n×n×n$n \times n \times n$ tripartite graph with minimum degree n+τ$n + \tau$ must contain Kt,t,t$K_{t, t, t}$, conjecturing that τ=O(n1/2)$\tau = \mathcal {O}(n^{1/2})$ for t=2$t = 2$.
Francesco Di Braccio +1 more
wiley +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Hamiltonian Normal Cayley Graphs
Discussiones Mathematicae Graph Theory, 2019 A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +1 more source
On the Foundational Arguments of Sufficient Dimension Reduction
WIREs Computational Statistics, Volume 18, Issue 2, June 2026.Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley +1 more source
Strongly regular tri-Cayley graphs [PDF]
, 2009 A graph is called tri-Cayley if it admits a semiregular subgroup of automorphisms having three orbits of equal length. In this paper, the structure of strongly regular tri-Cayley graphs is investigated.
Miklavič, Štefko +3 more
core +1 more source
European Journal of Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Connectivity of addition Cayley graphs
Journal of Combinatorial Theory, Series B, 2009 For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.
David J. Grynkiewicz +2 more
openaire +2 more sources
ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS
Studia Universitatis Babes-Bolyai Chemia, 2016 An (r, s)-fullerene graph is a planar 3-regular graph with only Cr and Cs faces, where Cn denotes a cycle of length n. In this paper, the (3,6)-fullerene Cayley graphs constructed from finite groups are classified.
Ali Reza ASHRAFI +2 more
doaj