On tensor powers of integer programs
SIAM Journal on Discrete Mathematics
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Factoring Cartesian-product graphs
Journal of Graph Theory
Note: On the chromatic number and independence number of hypergraph products
Journal of Combinatorial Theory Series B
Topics in Graph Theory: Graphs and Their Cartesian Product
Topics in Graph Theory: Graphs and Their Cartesian Product
Factorization of products of hypergraphs: Structure and algorithms
Theoretical Computer Science
Hi-index | 0.00 |
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs to directed and infinite hypergraphs. The proof adopts the strategy outlined by Imrich and Žerovnik for the case of graphs and introduces the notion of diagonal-free grids as a replacement of the chord-free 4-cycles that play a crucial role in the case of graphs. This leads to a generalization of relation Δ on the arc set, whose convex hull is shown to coincide with the product relation of the prime factorization. © 2011 Wiley Periodicals, Inc. J Graph Theory © 2012 Wiley Periodicals, Inc.