Results 81 to 90 of about 1,981 (215)
Enumeration of Connected Uniform Hypergraphs [PDF]
, 2005 In this paper, we are concerned in counting exactly and asymptotically connected labeled $b$-uniform hypergraphs ($b \geq 3$). Enumerative results on connected graphs are generalized here to connected uniform hypergraphs.
Ravelomanana, Vlady +1 more
core
On upper transversals in 3-uniform hypergraphs [PDF]
, 2018 A set S of vertices in a hypergraph H is a transversal if it has a nonempty intersection with every edge of H. The upper transversal number Υ(H) of H is the maximum cardinality of a minimal transversal in H.
Yeo, Anders; id_orcid +1 more
core +1 more source
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc +2 more
doaj +1 more source
Quantitative Biology, Volume 14, Issue 3, September 2026.Abstract Single‐cell RNA sequencing (scRNA‐seq) has transformed the study of cellular heterogeneity by making it possible to classify individual cells and their functional states. However, the analysis remains difficult because high dropout rates lead to sparse and noisy expression data.
Shahriar Rahman Niloy +5 more
wiley +1 more source
Transversals and domination in uniform hypergraphs
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csilla Bujtás +2 more
openaire +2 more sources
The number of regular simplices in higher dimensions
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract We study the extremal function Sdk(n)$S^k_d(n)$, defined as the maximum number of regular (k−1)$(k-1)$‐simplices spanned by n$n$ points in Rd$\mathbb {R}^d$. For any fixed d⩾2k⩾6$d\geqslant 2k\geqslant 6$, we determine the asymptotic behavior of Sdk(n)$S^k_d(n)$ up to a lower‐order term.
Felix Christian Clemen +2 more
wiley +1 more source
Constructing Union-Free pairs of K-Element subsets [PDF]
, 2013 It is proved that one can choose [1/2(n/k)] disjoint pairs of k-element subsets of an n-element set in such a way that the unions of the pairs are all different, supposing that n > n(k)
Katona, Gyula
core
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
Irregular triads in 3-uniform hypergraphs [PDF]
Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi.
core +1 more source
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