Results 31 to 40 of about 25,758 (195)
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
Independence densities of hypergraphs [PDF]
, 2013 We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational structures, such as ...
Bonato, Anthony +3 more
core +3 more sources
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory, Series B, 2023 22 pages.
Ding, Laihao +4 more
openaire +3 more sources
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources
Quasi‐random hypergraphs [PDF]
Random Structures & Algorithms, 1989 AbstractWe introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random.
Chung, F. R. K., Graham, R. L.
openaire +3 more sources
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 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
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
A family of extremal hypergraphs for Ryser's conjecture [PDF]
, 2018 Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the hypergraph is ...
Abu-Khazneh, Ahmad +3 more
core +3 more sources
, 2011 Hypergraphs are generalization of graphs where each edge (hyperedge) can connect more than two vertices. In simple terms, the hypergraph partitioning problem can be defined as the task of dividing the vertices of hypergraph into two or more roughly equal sized parts such that a cost function on the hyperedges connecting vertices in different parts is ...
Quincey Koziol +13 more
openaire +3 more sources