Results 21 to 30 of about 8,099 (222)
, 2011 A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik +3 more
openaire +3 more sources
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2023 Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette +2 more
openaire +3 more sources
, 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
Regular Bipolar Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on
Muhammad Aslam Malik +3 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
The Electronic Journal of Combinatorics, 2010 The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Zdenek Dvorák 0001 +3 more
openaire +2 more sources
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +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
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
Journal of the London Mathematical Society, 2019 Let $\text{Tr}(n,m,k)$ denote the largest number of distinct projections onto $k$ coordinates guaranteed in any family of $m$ binary vectors of length $n$. The classical Sauer-Perles-Shelah Lemma implies that $\text{Tr}(n, n^r, k) = 2^k$ for $k \le r$. While determining $\text{Tr}(n,n^r,k)$ precisely for general $k$ seems hopeless even for constant $r$,
Noga Alon, Guy Moshkovitz, Noam Solomon
openaire +3 more sources