Figure 1 - uploaded by Zoltán Lóránt Nagy
Content may be subject to copyright.
Modified coloring if q ≡ 0 (mod 3)
Source publication
In this paper, we study vertex colorings of hypergraphs in which all color class sizes differ by at most one (balanced colorings) and each hyperedge contains at least two vertices of the same color (rainbow-free colorings). For any hypergraph $H$, the maximum number $k$ for which there is a balanced rainbow-free $k$-coloring of $H$ is called the ba...
Similar publications
The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems. Being different from the classical graph entropy, we extend this concept to a hypergraph. Then, w...
Hypergraphs are a highly expressive data structure for modeling and programming, for which high-level language constructs are yet to be established. HyperLMNtal is a modeling language based on hypergraph rewriting. Rewrite rules can copy and remove subgraphs identified by graph types which serve as a wildcard construct that enables powerful handlin...
The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its projection. Feasibility of this task depends on $d$ and the density of hyperedges in the random hypergraph. For...
Hypergraph analysis extends traditional graph theory by enabling the study of complex, many-to-many relationships in networks, offering powerful tools for understanding brain connectivity. This case study introduces a novel methodology for constructing both graphs and hypergraphs of functional brain connectivity during figurative attention tasks, w...
We consider the vertex cover problem with multiple coverage constraints in hypergraphs. In this problem, we are given a hypergraph \(G=(V,E)\) with a maximum edge size f, a cost function \(w: V\rightarrow {\mathbb {Z}}^+\), and edge subsets \(P_1,P_2,\ldots ,P_r\) of E along with covering requirements \(k_1,k_2,\ldots ,k_r\) for each subset. The ob...
