On core of categorical product of (di)graphs

TL;DR

This paper investigates the properties of cores in categorical graph products, providing methods to construct cores whose products are also cores, with implications for graph homomorphisms and the Hedetniemi conjecture.

Contribution

It introduces new methods for constructing cores with core products and establishes sufficient conditions for such cores, extending understanding of graph homomorphisms.

Findings

Constructed a family of digraphs with core product properties.

Provided sufficient conditions for cores to have core products.

Developed a transformation method from digraphs to graphs.

Abstract

The core of a graph is the smallest graph (in terms of number of vertices) to which it is homomorphically equivalent. The question of the possible order of the core of the tensor product (also known as categorical, Heidetnemi or direct product) of two graphs captures some well known problems. For instance, the recent counterexample to the Hedetniemi conjecture for 5-chromatic graphs is equivalent to saying that there are cores of order at least 5 whose product has a core of order 4. In this work, motivated by a question from Leonid Libkin in the area of graph databases, we first present methods of building cores whose categorical product is also a core. Extending on this we present sufficient conditions for a set of cores to have a product which is also a core. Presenting an example of such a family of digraphs, we construct a family of $\binom{2n}{n}$ digraphs, where the number of vertices of each is between $n^2+5n+2$ and $3n^2+3n+2$ and the product is a core. We then present a method of transforming the example into a family of graphs.