Results 41 to 50 of about 8,142 (223)
Effective epidemic containment strategy in hypergraphs
Physical Review Research, 2021 Recently, hypergraphs have attracted considerable interest from the research community as a generalization of networks capable of encoding higher-order interactions, which commonly appear in both natural and social systems.
Bukyoung Jhun
doaj +1 more source
, 1981 We define a new class of hypergraphs (partitive hypergraphs) which generalizes both, the set of all externally related subsets of a graph and the set of all committees of an hypergraph.We give a characterization of the partitive hypergraphs and moreover ...
Chein, M., Maurer, M.C., Habib, M.
core +1 more source
Directed n-Superhypergraphs Incorporating Bipolar Fuzzy Information: A Multi-Tier Framework for Modeling Bipolar Uncertainty in Complex Networks [PDF]
Neutrosophic Sets and SystemsGraph theory studies the mathematical structures of vertices and edges to model relationships and connectivity. Hypergraphs extend this framework by allowing hyperedges to connect arbitrarily many vertices at once [1], and Super-HyperGraphs further ...
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
A Theoretical Investigation Based on the Rough Approximations of Hypergraphs
Journal of Mathematics, 2022 Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions.
Musavarah Sarwar
doaj +1 more source
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory, Series B, 2023 22 pages.
Laihao Ding +4 more
openaire +3 more sources
Journal of Pure and Applied Algebra, 2019 38 ...
Brendan Fong, David I. Spivak
openaire +4 more sources
A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +1 more source
Constructible hypergraphs [PDF]
, 1991 The class M of finite manuals (i.e. hypergraphs formed by the cliques of finite graphs) is closed under the formation of sums and products. We define the class of constructible hypergraphs to be the smallest subclass of M which contains all finite ...
Christian Schindler +1 more
core +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