Results 51 to 60 of about 11,526 (190)
Leveraging Artificial Intelligence and Large Language Models for Cancer Immunotherapy
Advanced Science, EarlyView.Cancer immunotherapy faces challenges in predicting treatment responses and understanding resistance mechanisms. Artificial intelligence (AI) and machine learning (ML) offer powerful solutions for cancer immunotherapy in patient stratification, biomarker discovery, treatment strategy optimization, and foundation model development.
Xinchao Wu +4 more
wiley +1 more source
Judiciously 3‐partitioning 3‐uniform hypergraphs [PDF]
Random Structures & Algorithms, 2020 Bollobás, Reed, and Thomason proved every 3‐uniform hypergraph ℋ with m edges has a vertex‐partition V()=V1⊔V2⊔V3 such that each part meets at least edges, later improved to 0.6m by Halsegrave and improved asymptotically to 0.65m+o(m) by Ma and Yu. We improve this asymptotic bound to , which is best possible up to the error term, resolving a special ...
Spink, Hunter, Tiba, Marius
openaire +3 more sources
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
, 2017 For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$.
Reiher, Christian +2 more
core +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
Randi´c Matrix and Randi´c Energy of Uniform Hypergraphs [PDF]
Mathematics Interdisciplinary ResearchThe Randi´c matrix $R=[r_{ij}]$ of a graph $ G=(V,E) $ was defined as $r_{ij}=\frac{1}{\sqrt{d_id_j}}$ if vertices $v_i$ and $v_j$ are adjacent and $r_{ij}=0$ otherwise, where $d_i$ is the degree of the vertex $v_i\in V$.
Gholam Hassan Shirdel +2 more
doaj +1 more source
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +1 more source
Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
, 2016 Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs ...
Dukkipati, Ambedkar +1 more
core +1 more source