We strengthen and put in a broader perspective previous results of the first
two authors on colliding permutations. The key to the present approach is a new
non-asymptotic invariant for graphs.Comment: 1+14 page

Körner, János

Malvenuto, Claudia

Simonyi, Gábor

English

arXiv

For a finite graph G whose vertices are different natural numbers we call two infinite permutations of the natural numbers G-different if they have two adjacent vertices of G somewhere in the same position. The maximum number of pairwise G-different permutations of the naturals is always finite. We study this maximum as a graph invariant and relate it to a problem of the first two authors on colliding permutations. An improvement on the lower bound for the maximum number of pairwise colliding permutations is obtained. © 2008 Society for Industrial and Applied Mathematics

Graph-different permutations

Abstract

Similar works

Full text

Available Versions

Archivio della ricerca- Università di Roma La Sapienza