Search
Search Results
-
Probabilistic hypergraph containers
Given a k -uniform hypergraph ℋ and sufficiently large m ≫ m 0 (ℋ), we show that an m-element set I ⊆ V (ℋ), chosen uniformly at random, with probability...
-
Hypergraph co-optimal transport: metric and categorical properties
Hypergraphs capture multi-way relationships in data, and they have consequently seen a number of applications in higher-order network analysis,...
-
Multi-Linear Pseudo-PageRank for Hypergraph Partitioning
Motivated by the PageRank model for graph partitioning, we develop an extension of PageRank for partitioning uniform hypergraphs. Starting from...
-
More efficient algorithms for searching for several edges in a hypergraph
The edge searching problem is a generalization of the classical group testing problem. Chen and Hwang studied the problem of searching for many edges...
-
The Abstract Laplacian Tensor of a Hypergraph with Applications in Clustering
The normalized abstract Laplacian tensor of a weighted hypergraph is investigated. The connectivity of the hypergraph is associated with the...
-
Finding a minimal spanning hypertree of a weighted hypergraph
A hypergraph has a complex structure, which is why some re- searchers seek to transform the hypergraph into a graph. In this paper, we present two...
-
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph
Let H be a complete r -uniform hypergraph such that two vertices are marked in each edge as its ‘boundary’ vertices. A linear ordering of the vertex...
-
On the zero-divisor hypergraph of a reduced ring
The concept of zero-divisor graphs of rings is widely used for establishing relationships between the properties of graphs and the properties of the...
-
-
The average tree value for hypergraph games
We consider transferable utility cooperative games (TU games) with limited cooperation introduced by a hypergraph communication structure, the...
-
A Hypergraph Turán Problem with No Stability
A fundamental barrier in extremal hypergraph theory is the presence of many near-extremal constructions with very different structures. Indeed, the...
-
Applying a hypergraph to determine the structure of some finite modules
Characterization of a finite module with specified number of nontrivial submodules is one of the most important issues for researchers in module...
-
Hypergraph Edge Representations with the Use of Homological Paths
AbstractWe consider the problem of realization of hypergraphs on a graph provided each hyperedge is realized by a subgraph in which exactly two...
-
On Some Generalizations of the Property B Problem of an n-Uniform Hypergraph
The extremal problem of hypergraph colorings related to the Erdős–Hajnal property B -problem is considered. Let k be a natural number. The problem is...
-
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and...
-
Hypergraph Turán Numbers of Vertex Disjoint Cycles
The Turán number of a k -uniform hypergraph H , denoted by ex k ( n ; H ), is the maximum number of edges in any k -uniform hypergraph F on n vertices which...
-
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
We consider the max hypergraph 3-cut problem with limited unbalance (MH3C-LU). The objective is to divide the vertex set of an edge-weighted...
