Results 41 to 50 of about 1,981 (215)
Effective epidemic containment strategy in hypergraphs
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
Covering Non-uniform Hypergraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros +3 more
openaire +2 more sources
Complement Reducible Uniform Hypergraphs
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj +1 more source
On the Degree Sequences of Uniform Hypergraphs [PDF]
In hypergraph theory, determining a good characterization of d, the degree sequence of an h-uniform hypergraph $\mathcal{H}$, and deciding the complexity status of the reconstruction of $\mathcal{H}$ from d, are two challenging open problems. They can be formulated in the context of discrete tomography: asks whether there is a matrix A with nonnegative
FROSINI, ANDREA +2 more
openaire +2 more sources
Decompositions of Complete Uniform Multipartite Hypergraphs [PDF]
In recent years, researchers have studied the existence of complete uniform hypergraphs into small-order hypergraphs. In particular, results on small 3-uniform graphs including loose 3, 4, and 5 cycles have been studied, as well as 4-uniform loose cycles
Ward, Patrick
core +1 more source
The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets.
Balázs Keszegh, Dömötör Pálvölgyi
doaj +1 more source
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m-uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral ...
Lei Zhang, Haizhen Ren
doaj +1 more source
In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
Hypergraphs with a Quarter Uniform Turán Density [PDF]
International audienceThe uniform Turán density of a -uniform hypergraph is the supremum over all for which there is an -free hypergraph with the property that every linearly sized subhypergraph with density at least .
Wang, Guang-Hui +3 more
core +1 more source
Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures
This paper continues the study of second-order signature properties—the characterization of the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform hypergraphs.
Evgeniya Egorova +3 more
doaj +1 more source

