Search
Search Results
-
On the Maximal Cut in a Random Hypergraph
AbstractThis paper deals with the problem of finding the max-cut for random hypergraphs. We consider the classical binomial model
... -
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions
The densest subgraph problem (DSG) aiming at finding an induced subgraph such that the average edge-weights of the subgraph is maximized, is a...
-
On 2-Factorizations of the Complete 3-Uniform Hypergraph of Order 12 Minus a 1-Factor
A k-factorization of the complete t-uniform hypergraph \(K^{(t)}_{v}\)...
-
Hypergraph Topology
Consider a hypergraph H with vertex set \(V=\{v_1,v_2,\ldots v_n\}\)...
-
Bounding the Trace Function of a Hypergraph with Applications
An upper bound on the trace function of a hypergraph H is derived and its applications are demonstrated. For instance, a new upper bound for the VC...
-
On the s-Colorful Number of a Random Hypergraph
We study the problem of finding the s -colorful number of a random hypergraph in the binomial model. For different probabilities of the edge...
-
Spectrum of the 3-zero-divisor Hypergraph of Some Classes of Local Rings
In this paper, we initiate the study of the spectrum of the 3-zero-divisor hypergraph of commutative rings. We first compute the adjacency matrix of...
-
The Linear Unicyclic Hypergraph with the Second or Third Largest Spectral Radius
The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor of the hypergraph. It is known that the unique unicyclic...
-
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Finding a homomorphism from some hypergraph \({\mathcal Q} \)...
-
Relating Hypergraph Parameters of Generalized Power Graphs
Graph parameters like the chromatic number, independence number, clique number and many others alongside with their corresponding adjacency matrix...
-
Homotopy and Hom Construction in the Category of Finite Hypergraphs
We define notions of a weak homotopy for finite hypergraphs and an exponential hypergraph with a right adjoint to the categorical product of finite...
-
Some Bounds on the Spectral Radius of Uniform Hypergraphs
Let ℋ be a uniform hypergraph. In this paper, we obtain several bounds for the spectral radius of ℋ in terms of the parameters such as q -average-degre...
-
A Tensor Optimization Algorithm for Computing Lagrangians of Hypergraphs
The Lagrangian of a hypergraph is a crucial tool for studying hypergraph extremal problems. Though Lagrangians of some special structure hypergraphs,...
-
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
We consider the problem of deterministically enumerating all minimum k -cut-sets in a given hypergraph for fixed constant k . The input here is a...
-
