Results 121 to 130 of about 8,099 (222)
, 1985 This paper deals with three generalizations of threshold graphs to hypergraphs proposed by M. Ch. Golumbic. Answering a question of M. Ch. Golumbic we show that these three definitions are not equivalent.
Šiňajová, Edita +3 more
core +1 more source
Connected components in networks with higher-order interactions
Journal of Physics: ComplexityWe address the problem of defining connected components in hypergraphs, which are models for systems with higher-order interactions. For graphs with dyadic interactions, connected components are defined in terms of paths connecting nodes along the graph.
Gyeong-Gyun Ha +2 more
doaj +1 more source
Matchings in balanced hypergraphs
, 2011 The present work deals with the matching and vertex cover problem in balanced hypergraphs. This class of hypergraphs is, according to the definition by Berge in the 70s, one possible generalization of bipartite graphs.
Scheidweiler, Robert Berthold
core
Homomorphisms of quantum hypergraphs
, 2023 We introduce quantum homomorphisms between quantum hypergraphs through the existence of perfect strategies for quantum non-local games, canonically associated with the quantum hypergraphs.
Todorov, Ivan G., Hoefer, Gage
core
Colourings of hypergraphs [PDF]
, 1976 In Chapter 2, we describe some generalized chromatic numbers of graphs. In Chapter 3, we describe how these may be regarded as chromatic numbers of associated hypergraphs.
Jones, Rhys Price
core
, 2023 Random recursive hypergraphs grow by adding, at each step, a vertex and an edge formed by joining the new vertex to a randomly chosen existing edge. The model is parameter-free, and several characteristics of emerging hypergraphs admit neat expressions ...
Krapivsky, P. L.
core
International Mathematics Research NoticesAbstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire +2 more sources
Infinite hypergraphs I. Basic properties
, 1991 Basic properties of the category of infinite directed hyperedge-labelled hypergraphs are studied. An algebraic structure is given which enables us to describe such hypergraphs by means of infinite expressions. It is then shown that two expressions define
Bauderon, Michael
core +1 more source
Entropy-based models to randomise real-world hypergraphs
Communications PhysicsNetwork theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems.
Fabio Saracco +3 more
doaj +1 more source
Extending Graph-Based LP Techniques for Enhanced Insights Into Complex Hypergraph Networks
IEEE AccessMany real-world problems can be modelled in the form of complex networks. Social networks such as research collaboration networks and facebook, biological neural networks such as human brains, biomedical networks such as drug-target interactions and ...
Y. V. Nandini +4 more
doaj +1 more source