Results 81 to 90 of about 25,758 (195)

Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs

Discussiones Mathematicae Graph Theory, 2022
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney’s broken cycle theorem for hypergraphs, as well as deriving an explicit ...
Durhuus Bergfinnur, Lucia Angelo
doaj   +1 more source

Eigenvalues of Non-Regular Linear-Quasirandom Hypergraphs [PDF]

, 2014
Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for the so-called ...
Lenz, John, Mubayi, Dhruv
core  

On Asymmetric Hypergraphs

, 2021
In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs. We also determine, for every $k\ge 1$, the minimum size of an asymmetric $k$-uniform hypergraph.
Jiang, Yiting, Nešetřil, Jaroslav
openaire   +2 more sources

Large language models for bioinformatics

Quantitative Biology, Volume 14, Issue 1, March 2026.
Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan, Yanjun Lyu, Jing Zhang, Jiazhang Cai, Peng Shu, Yang Ge, Yao Lu, Shang Gao, Yue Wang, Peilong Wang, Lin Zhao, Tao Wang, Yufang Liu, Luyang Fang, Ziyu Liu, Zhengliang Liu, Yiwei Li, Zihao Wu, Junhao Chen, Hanqi Jiang, Yi Pan, Zhenyuan Yang, Jingyuan Chen, Shizhe Liang, Wei Zhang, Terry Ma, Yuan Dou, Jianli Zhang, Xinyu Gong, Qi Gan, Yusong Zou, Zebang Chen, Yuanxin Qian, Shuo Yu, Jin Lu, Kenan Song, Xianqiao Wang, Andrea Sikora, Gang Li, Xiang Li, Quanzheng Li, Yingfeng Wang, Lu Zhang, Yohannes Abate, Lifang He, Wenxuan Zhong, Rongjie Liu, Chao Huang, Wei Liu, Ye Shen, Ping Ma, Hongtu Zhu, Yajun Yan, Dajiang Zhu, Tianming Liu   +54 more
wiley   +1 more source

On the separability of elements and sets in hypergraphs of models of a theory

Қарағанды университетінің хабаршысы. Математика сериясы, 2016
We consider topological properties of hypergraphs of models of a theory. The separability of elements in these hypergraphs is characterized in terms of algebraic closures. Similarly we specify the separability of sets by the hypergraphs.
S.V. Sudoplatov
doaj  

Colorful Subhypergraphs in Kneser Hypergraphs [PDF]

The Electronic Journal of Combinatorics, 2014
Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of
openaire   +3 more sources

A comprehensive review of cluster methods for drug–drug interaction network

Quantitative Biology, Volume 14, Issue 1, March 2026.
Abstract The detection of drug–drug interaction (DDI) is crucial to the rational use of drug combinations. Experimentally, DDI detection is time‐consuming and laborious. Currently, researchers have developed a variety of computational methods to predict DDI.
Shuyuan Cao, Guixia Liu, Xiangrun Zhou, Ji Lv   +3 more
wiley   +1 more source

Analysis of hub parameters in fuzzy hypergraphs extending to intuitionistic fuzzy threshold hypergraphs: Applications in designing transport networks in amusement parks using hub hyperpaths [PDF]

Notes on IFS
A hypergraph is a generalization of a graph where an edge can connect any number of vertices. In this paper, many different aspects of fuzzy hypergraphs and their applications are examined.
K. K. Myithili, C. Nandhini
doaj   +1 more source

Random Walks on Hypergraphs with Edge-Dependent Vertex Weights

, 2019
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research.
Chitra, Uthsav, Raphael, Benjamin J
core  

Zarankiewicz bounds from distal regularity lemma

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source