ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A natural graph is a simple graph whose vertex set is a finite subset of N\mathbb{N}. Two infinite permutations of N\mathbb{N} are GG-different if, for some coordinate i∈Ni\in\mathbb{N}, the two entries at that coordinate are the endpoints of an edge of GG. Let κ(G)\kappa(G) be the maximum cardinality of a set of infinite permutations that are pairwise GG-different, and define

K(ℓ)=max⁡{κ(G)   ∣E(G)∣=ℓ}.K(\ell)=\max\{\kappa(G)\;\ |E(G)|=\ell\}.

The maximum G-different permutation conjecture. For every ℓ∈N\ell\in\mathbb{N},

K(ℓ)=3ℓ.K(\ell)=3^\ell.

The paper proves that K(ℓ)K(\ell) lies between 3ℓ3^\ell and 4ℓ4^\ell for every natural number ℓ\ell, so the conjectured exact lower endpoint remains unresolved.

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.