Existence of regular open and closed XOR-magic graphs of power-of-two order

From papers

Let nn be a positive integer, and let dd be a degree. An open XOR-magic graph and a closed XOR-magic graph are graphs admitting, respectively, an open or closed XOR-magic labeling. The graphs below are required to have order 2n2^n.

For each degree

d{5,7,,2n7,2n5},d\in\{5,7,\ldots,2^n-7,2^n-5\},

there exists a dd-regular open XOR-magic graph of order 2n2^n. For each degree

d{4,6,,2n6,2n4},d\in\{4,6,\ldots,2^n-6,2^n-4\},

there exists a dd-regular closed XOR-magic graph of order 2n2^n.

Existence conjecture. For every permitted degree dd in the two displayed sets, the corresponding regular open or closed XOR-magic graph exists. This would complete the existence picture apart from the degrees excluded by the previously stated nonexistence result and extend the constructions known for order 1616 and order 88 to every order that is a power of two.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Sylwia Cichacz, Hubert Grochowski and Rita Zuazua, “Open XOR-magic odd graphs and closed XOR-magic even graphs”, arXiv:2512.19278 (2025).

Solutions 0

No solutions have been posted yet.