---
title: Partial Star Products in Graphs and Semigroups
url: https://www.emergentmind.com/topics/partial-star-products-psps
type: topic
---

# Partial Star Products in Graphs and Semigroups

Partial Star Products (PSPs) are a central notion for the local decomposition of product-like structures in both finite graphs and commutative partial semigroups. In the domain of graph theory, especially regarding recognition and approximation of Cartesian product graphs, PSPs provide a localized covering by small induced subgraphs that retain, and locally reveal, the combinatorial fingerprints of product structure. In the context of partial semigroups, related partial star-product phenomena underpin advanced Ramsey-theoretic and ultrafilter results, notably via analogues of the Bergelson–Hindman theorems. Theoretical foundations and algorithmic frameworks for PSPs are developed in works by Hellmuth, Imrich, Kupka, and others [1308.2101][1303.6803][1909.10896].

## 1. Formal Definitions and Structural Properties

In a connected, finite, simple graph $G=(V,E)$, the Partial Star Product $S_v$ at a vertex $v\in V$ is constructed as follows. Let $E_v = \{ e \in E : v\in e \}$ denote the set of primal edges incident to $v$. Define the local relation ${}_v$ as ${}_v = \{(e,f)\in\delta_G : e\in E_v \text{ or } f\in E_v\}$, where $\delta_G$ is a reflexive, symmetric relation on $E$ such that $(e,f)\in\delta_G$ if $e = f$, or $e$ and $f$ are adjacent without a unique chordless square, or are opposite edges of a chordless square. The non-primal edges $F_v$ are those not in $E_v$ but “opposite” to a primal edge in a chordless square spanned between a non-equivalent pair $(e, e')$ of $E_v$, that is, $F_v = \{ f\notin E_v : \exists e,e'\in E_v,~ (e,e')\notin {}_v^*,~ f~\text{opposite~of}~e' \}$. The induced subgraph $S_v$ with edge set $E(S_v) = E_v \cup F_v$ is then called the Partial Star Product at $v$, with $v$ as the center, and primal/non-primal edges as above [1308.2101][1303.6803].

Structurally, $S_v$ admits a star-factor decomposition: if ${}_v^*$ (the transitive closure of the local relation) has $k$ equivalence classes, then $S_v$ is isomorphic (and in fact isometric) to the induced $2$-neighborhood around the identity in the product $H = \Box_{i=1}^k \mathbb S_i$, where each $\mathbb S_i$ is a star centered at $v$. This isometry preserves local distance structure and the key edge equivalence classes [1303.6803].

## 2. Role in Recovering Cartesian Product Structure

The $\delta_G^*$ relation, the transitive closure of $\delta_G$, is pivotal: it determines the maximal product labeling underlying the canonical prime-factor decomposition of $G$ with respect to the Cartesian product. The union of the local equivalence relations induced on all PSPs, i.e., $(\bigcup_{v\in V} {}_{|S_v})^*$, precisely recovers $\delta_G^*$. Thus, by constructing all PSPs and analyzing local edge colorings (equivalence classes), one can globally reconstruct the hidden product structure, even in graphs where global recognition would otherwise be intractable [1308.2101][1303.6803].

In disturbed or nearly-prime graphs, the presence of multiple local equivalence classes in some PSPs signals remnant product-like structure that can be globally pieced together by merging local relations.

## 3. Algorithms and Data Structures for PSP Recognition

Efficient computation of PSPs and associated edge colorings is achieved through specialized data structures and constant-time-per-edge local operations. The key steps for a given center $c$ are as follows:

- Mark primal neighbors and prepare incidence/absence matrices of size $\deg(c)\times\deg(c)$.
- Conduct a $2$-hop scan from $c$ to identify primal and non-primal vertices, updating matrices according to the existence and uniqueness of chordless squares.
- Assign and merge local colors to primal edges using Union-Find, guided by matrix entries.
- Deduce colors for non-primal edges by inheritance from their unique opposite primal edge.
- Merge local colorings with global colors via Union-Find, ensuring a consistent global coloring reflecting $\delta_G^*$.

The overall complexity for a graph with maximum degree $\Delta$ is $O(|E|\cdot\Delta)$ time and $O(|E|+\Delta^2)$ space, reducing to linear in the bounded-degree case [1308.2101]. An alternative algorithm described in [1303.6803] achieves $O(|V|\Delta^4)$ for local covering/coloring and factor extraction, supporting coordinate assignments and the reconstruction of factor graphs.

## 4. Applications in Graph Product Recognition and Approximation

PSPs are instrumental in diverse graph product contexts. When $G$ is an exact Cartesian product, $\delta_G^*$ yields two global edge classes matching the factors. Each $S_v$ is literally a product of two stars, $K_{1, \deg_A(v)}\Box K_{1, \deg_B(v)}$, as in $A \Box B$. In quasi-Cartesian graphs, where local product-like behavior is present but global decomposition fails (e.g., Möbius-twisted products), PSPs with multiple color classes still reflect this local structure. For approximate products, the PSP machinery enables heuristic and polynomial-time recovery of optimal Cartesian approximations—even in NP-complete scenarios where global product editing is unconstrained [1308.2101][1303.6803].

By covering $G$ with a suitable family of PSPs and merging local classes, one may recover large subgraphs that admit coordinate assignments, supporting embedding into an explicit product of smaller factors.

## 5. PSP Phenomena in Partial Semigroups

In the context of partial semigroups, the partial star-product phenomenon underlies combinatorial structure in Ramsey-theoretic settings. For a family of countable adequate commutative partial semigroups $(S_i,\cdot)$, the existence of IP$^*$-sets in the product $S_1\times\ldots\times S_\ell$ ensures, via the partial semigroup PSP theorem, that for any $m$, there are infinite adequate sequences whose coordinatewise Cartesian products of finite sums remain entirely within the IP$^*$-set [1909.10896]. The arguments rely on ultrafilter extensions of partial semigroup operations and compactness, paralleling the combinatorial decomposition achieved via PSPs in graphs but now in an abstract algebraic setting.

## 6. Illustrative Examples and Limitations

Example scenarios in both settings emphasize the distinguishing characteristics of PSPs:

- In graphs, for $G$ with a 2-neighborhood at $v$ factorable into two directions, $S_v$ corresponds to a small isometric patch analogous to a subproduct $K_{1,a}\Box K_{1,b}$; such patches can be assembled to approximate large-scale product structure [1303.6803].
- In partial semigroups, for $S = \mathbb{N}$ with partial addition $x \oplus y$ (defined iff $x < y$), the PSP phenomena yield sequences whose finite sums in any coordinate have controlled combinatorial features (e.g., all-even parity), as guaranteed by the ultrafilter-based PSP theorem [1909.10896].

A central limitation is that in graphs with high global “primeness” (few non-trivial PSPs), or insufficient overlap of non-trivial PSPs, the method may not recover substantial product structure. For exact product recognition under unrestricted editing, the underlying problem is NP-complete; thus, PSP-based methods serve as polynomial-time heuristics, particularly valuable in “noisy” or perturbed product-like graphs [1303.6803].

## 7. Connections and Generalizations

The methodology and results surrounding PSPs extend naturally to more general algebraic and combinatorial settings. In partial semigroups, the structure theorem for IP$^*$-sets and PSPs generalizes to arbitrary cardinalities, to left or two-sided adequate semigroups, and—via ultrafilter techniques—even to non-commutative analogues [1909.10896]. Possible directions for further generalization include the development of full central sets theorems and the analysis of PSP-like decompositions in infinite product spaces, with potential applications to Ramsey theory on trees and variable word structures.

---

**References**

- Hellmuth, Imrich, Kupka. "Fast Recognition of Partial Star Products and Quasi Cartesian Products" [1308.2101]
- Hellmuth, Imrich, Kupka. "Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs" [1303.6803]
- Chakraborty. "$IP^\star$ set in product space of countable adequate commutative partial semigroups" [1909.10896]

Source: https://www.emergentmind.com/topics/partial-star-products-psps