Results 91 to 100 of about 14,658 (182)

FUZZY HYPERGRAPH AND FUZZY PARTITION

, 1995
In this paper, the concept of hypergraph is extended to the fuzzy hypergraph. In the fuzzy hypergraph, the concepts of alpha-cut hypergraph, strength of edge and dual fuzzy hypergraph are developed.
Lee, Kwang-Hyung, LEE, KM
core  

On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek   +2 more
wiley   +1 more source

Learning a Hidden Hypergraph [PDF]

, 2005
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergraph or not.
Jiang Chen, Dana Angluin
core   +1 more source

Rates of Evolution Differ Between Cell Types Identified by Single‐Cell RNAseq in Threespine Stickleback

Molecular Ecology, Volume 35, Issue 19, October 2026.
ABSTRACT Rates of evolutionary change vary by gene. While some broad gene categories are highly conserved with little divergence over time, others undergo continuous selection pressure and are highly divergent among populations or species. But such comparative evolutionary studies rely on gene ontology categories that are rarely validated in the study ...
Maria L. Rodgers, Swapna Subramanian, Lauren E. Fuess, Wan He, Samuel V. Scarpino, Andrea J. Roth‐Monzón, Daniel L. Jeffries, Martine Seignon, Kathryn Milligan‐McClellan, Rebecca Carrier, Natalie C. Steinel, Daniel I. Bolnick   +11 more
wiley   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

Directed hypergraph neural network [PDF]

, 2022
To deal with irregular data structure, graph convolution neural networks have been developed by a lot of data scientists. However, data scientists just have concentrated primarily on developing deep neural network method for un-directed graph.
Tran, Linh Hoang, Tran, Loc Hoang
core  

No‐(k+1)$(k+1)$‐in‐line problem for large constant k$k$

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract How many points can be placed in an n×n$n\times n$ grid so that every (affine) line contains at most k$k$ points? We prove that for n⩾k⩾1037$n \geqslant k \geqslant 10^{37}$ the maximum number of points is exactly kn$kn$. Our proof builds on the recent work of Kovács, Nagy and Szabó (who proved an analogous result when k$k$ is at least about ...
Alexandr Grebennikov, Matthew Kwan
wiley   +1 more source

Assigning entities to teams as a hypergraph discovery problem

Communications Physics
Assigning agents to teams under strict task and effort constraints is crucial in business, science, and engineering, where disruptions can cause significant losses.
Guilherme Ferraz de Arruda, Wan He, Nasimeh Heydaribeni, Tara Javidi, Yamir Moreno, Tina Eliassi-Rad   +5 more
doaj   +1 more source

Cross-modal Hypergraph Optimisation Learning for Multimodal Sentiment Analysis [PDF]

Jisuanji kexue
Sentiment expressions are multimodal,and more accurate emotions can be derived through multiple modalities such as verbal,audio,and visual.Studying the interactions among modalities can effectively improve the accuracy of multimodal sentiment analysis ...
JIANG Kun, ZHAO Zhengpeng, PU Yuanyuan, HUANG Jian, GU Jinjing, XU Dan
doaj   +1 more source

Bounded diameter monochromatic component covers

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley   +1 more source