ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every k∈Nk\in\mathbb{N}, there exists n0∈Nn_0\in\mathbb{N} such that for all n≥n0n\ge n_0, the complete kk-uniform hypergraph Kn(k)K_n^{(k)} has an Euler tour whenever kk divides (n−1k−1)\binom{n-1}{k-1}, i.e. k∣(n−1k−1)k\mid\binom{n-1}{k-1} implies that Kn(k)K_n^{(k)} has an Euler tour.

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.