Results 131 to 140 of about 56,309 (276)
Discrete Applied Mathematics, 2004 AbstractIf D=(V,A) is a digraph, its competition hypergraph CH(D) has vertex set V and e⊆V is an edge of CH(D) iff |e|⩾2 and there is a vertex v∈V, such that e=N−(v)={w∈V|(w,v)∈A}. Besides a motivation for this new concept, closely related to the well-known competition graphs, we present several properties of competition hypergraphs and discuss ...
Hanns-Martin Teichert, Martin Sonntag
openaire +2 more sources
Decomposing hypergraphs into k-colorable hypergraphs [PDF]
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(H) rceil$.
Khosro Tajbakhsh, Gholamreza Omidi
openaire +2 more sources
General Centrality in a hypergraph [PDF]
, 2014 The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality measurement for a ...
Busseniers, Evo
core
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
The Web Conference, 2019 Location Based Social Networks (LBSNs) have been widely used as a primary data source to study the impact of mobility and social relationships on each other.
Dingqi Yang +3 more
semanticscholar +1 more source
On the Replica Symmetric Solution in General Diluted Spin Glasses
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT We present a unifying approach to studying the replica symmetric solution in general diluted spin glass models on random p$$ p $$‐uniform hypergraphs with sparsity parameter α$$ \alpha $$. Our result shows that there exist two key regimes in which the model exhibits replica symmetry and the free energy can be explicitly represented as the ...
Ratul Biswas, Wei‐Kuo Chen, Arnab Sen
wiley +1 more source
Discrete Mathematics, 2006 AbstractWe introduce a theory of hypergraphical t-designs. We show the existence of these designs and prove a finiteness theorem on these designs for infinitely many parameter sets. We also give effective bounds on the number of points in these cases.
openaire +2 more sources
A Novel Algorithm for Imbalance Data Classification Based on Neighborhood Hypergraph
The Scientific World Journal, 2014 The classification problem for imbalance data is paid more attention to. So far, many significant methods are proposed and applied to many fields. But more efficient methods are needed still. Hypergraph may not be powerful enough to deal with the data in
Feng Hu, Xiao Liu, Jin Dai, Hong Yu
doaj +1 more source
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley +1 more source
Discrete Mathematics, 1976 AbstractA t-design T=(X, B), denoted by (λ; t, k, v), is a system B of subsets of size k from a v-set X, such that each t-subset of X is contained in exactly λ elements of B. A hypergraph H=(Y, E) is a finite set Y where E=(Ei: iϵI) is a family of subsets (which we assume here are distinct) of Y such that Ei≠Ø, iϵl, and ⋃Ei=Y.
Earl S. Kramer, Dale M. Mesner
openaire +1 more source
Sparse graph signals – uncertainty principles and recovery
GAMM-Mitteilungen, Volume 48, Issue 2, June 2025.ABSTRACT We study signals that are sparse either on the vertices of a graph or in the graph spectral domain. Recent results on the algebraic properties of random integer matrices as well as on the boundedness of eigenvectors of random matrices imply two types of support size uncertainty principles for graph signals.
Tarek Emmrich +2 more
wiley +1 more source