Results 71 to 80 of about 11,596 (195)

3-uniform hypergraphs and linear cycles [PDF]

Electronic Notes in Discrete Mathematics, 2017
Improved the writing, more explanation added and corrections ...
Beka Ergemlidze, Ervin Györi, Abhishek Methuku   +2 more
openaire   +3 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

Single‐Cell and Spatial Omics: Methods and Applications

MedComm, Volume 7, Issue 4, April 2026.
Systematically summarized the breakthrough sequencing technologies and computational methods for single‐cell and spatial omics across multiple omics layers, including genome, epigenome, transcriptome, proteome, and metabolome. State‐of‐the‐art methods for multi‐omics integration, cross‐modal integration, and cross‐scale integration were reviewed, with ...
Xiaoping Cen, Xiaolan Huang, Enjin Deng, Xue Gong, Na Tan, Jifeng Ye, Yin Wang, Roland Eils, Qun Luo, Yixue Li, Fangfang Qu   +10 more
wiley   +1 more source

Existential closure in uniform hypergraphs

Discrete Mathematics
For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of $T$ and no vertex of $S\setminus T$.
Andrea C. Burgess, Robert D. Luther, David A. Pike   +2 more
openaire   +2 more sources

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

Unsupervised hyperlink prediction based on hypergraph random walk

Complex & Intelligent Systems
Conventional link prediction methods mainly aim to estimate pairwise relationships between nodes in graph structures, typically addressing single-type interactions.
Yanlin Yang, Mingyuan Li, Lei Meng, Yuzhi Xiao, Zhonglin Ye, Haixing Zhao   +5 more
doaj   +1 more source

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs

We develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
A. Ambainis, A. Belovs, F. Magniez, F. Magniez, H. Buhrman, R. Beals, R. Williams, V. Vassilevska Williams, Y. Zhu   +8 more
core   +2 more sources

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie, Chuang Liu, Yang Chen, Zi‐Ke Zhang, Xiaoyang Liu, Xiu‐Xiu Zhan   +5 more
wiley   +1 more source

Hypergraphs with arbitrarily small codegree Turán density

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley   +1 more source