ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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,…,2n−7,2n−5},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,…,2n−6,2n−4},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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.