The maximum G-different permutation conjecture
Statement
A natural graph is a simple graph whose vertex set is a finite subset of . Two infinite permutations of are -different if, for some coordinate , the two entries at that coordinate are the endpoints of an edge of . Let be the maximum cardinality of a set of infinite permutations that are pairwise -different, and define
The maximum G-different permutation conjecture. For every ,
The paper proves that lies between and for every natural number , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.