Results 81 to 90 of about 698,372 (216)
Unsupervised hyperlink prediction based on hypergraph random walk
Complex & Intelligent SystemsConventional link prediction methods mainly aim to estimate pairwise relationships between nodes in graph structures, typically addressing single-type interactions.
Yanlin Yang +5 more
doaj +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
3-uniform hypergraphs and linear cycles [PDF]
Electronic Notes in Discrete Mathematics, 2017 Improved the writing, more explanation added and corrections ...
Beka Ergemlidze +2 more
openaire +5 more sources
Families of triples with high minimum degree are hamiltonian
Discussiones Mathematicae Graph Theory, 2014 In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj +1 more source
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2015 Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj +1 more source
International Journal of Imaging Systems and Technology, Volume 36, Issue 4, July 2026.ABSTRACT Gliomas are aggressive brain tumors that require accurate imaging‐based diagnosis, where automated segmentation plays a central role in assessing tumor morphology and guiding treatment decisions. Manual delineation of gliomas is time‐consuming and prone to variability, motivating the use of deep learning to improve consistency and alleviate ...
Cecilia Diana‐Albelda +4 more
wiley +1 more source
Judicious partitions of uniform hypergraphs [PDF]
Combinatorica, 2014 The vertices of any graph with $m$ edges may be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollobás and Thomason conjectured that the vertices of any $r$-uniform hypergraph with $m$ edges may likewise be partitioned into $r$ classes such that each part meets at least $\frac{r}{2r-1}m$ edges. In this paper we prove
openaire +3 more sources
CF‐SBERTHet: Collaborative and Textual Knowledge Enhanced Semantic Graphs for Sparse Recommendations
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Modern e‐commerce platforms face a critical challenge: delivering accurate recommendations under extreme user–item interaction sparsity, where textual context remains systematically underutilised. Existing collaborative filtering methods degrade sharply in sparse settings, while semantic approaches fail to capture collaborative patterns ...
He Ma +7 more
wiley +1 more source
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract Dedekind's problem, dating back to 1897, asks for the total number ψ(n)$\psi (n)$ of antichains contained in the Boolean lattice Bn$B_n$ on n$n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics, and as a result, obtain several new results on the number and typical ...
Matthew Jenssen +2 more
wiley +1 more source
Hamiltonicity and $\sigma$-hypergraphs
Theory and Applications of Graphs, 2014 We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj +1 more source