Results 41 to 50 of about 8,099 (222)
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory, Series B, 2023 22 pages.
Laihao Ding +4 more
openaire +3 more sources
Learning from high-order data: hypergraphs and smart codes
, 2023 Arce, Gonzalo R.Currently, there is an increasing need to develop tools that allow the processing and exploitation of the massive amount of data available in many fields, such as computer vision, biology, social sciences, computational image, and others.
Pena Pena, Karelia
core +1 more source
, 1992 In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on
Zverovich, Vadim +5 more
core +1 more source
Granulation of Hypernetwork Models under the q-Rung Picture Fuzzy Environment
Mathematics, 2019 In this paper, we define q-rung picture fuzzy hypergraphs and illustrate the formation of granular structures using q-rung picture fuzzy hypergraphs and level hypergraphs.
Anam Luqman +2 more
doaj +1 more source
The Electronic Journal of Combinatorics, 2016 A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\Omega(n^{r-r/\Delta})$ many edges.
Samuel Hetterich +2 more
openaire +3 more sources
Random Structures & Algorithms, 2012 AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Peter Allen 0001 +3 more
openaire +3 more sources
Uniform hypergraphs containing no grids
, 2013 A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
Annotated hypergraphs: models and applications
Applied Network Science, 2020 Hypergraphs offer a natural modeling language for studying polyadic interactions between sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive roles.
Philip Chodrow, Andrew Mellor
doaj +1 more source
, 2022 Inspired by earlier results about proper and polychromatic coloring of hypergraphs, we investigate such colorings of directed hypergraphs, that is, hypergraphs in which the vertices of each hyperedge is partitioned into two parts, a tail and a head.
Keszegh, Balázs, Balázs Keszegh
core +1 more source
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