Results 31 to 40 of about 11,124 (213)
, 2022 Here we prove the following result from finite set theory. Given a family S of five subsets of a 10-set, suppose |A△B|≥6 for all distinct A,B∈S. Prove that |A△B|=6 for all distinct A,B∈S.
Elmar Guseinov (13785133)
core +1 more source
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +1 more source
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
On Matchings in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all $k$-subsets which intersect a given set of $s$ vertices.
Peter Frankl +2 more
openaire +3 more sources
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Discussiones Mathematicae Graph Theory, 2016 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng +3 more
doaj +1 more source
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
Hypergraphs in m-Polar Fuzzy Environment
Mathematics, 2018 Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
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 +4 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 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