Pairwise colliding permutations and the capacity of infinite graphs

Authors:
János Körner;Claudia Malvenuto
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2006

Citing 0
Cited 4

On types of growth for graph-different permutations

Journal of Combinatorial Theory Series A
Permutation Capacities of Families of Oriented Infinite Paths

SIAM Journal on Discrete Mathematics
On Reverse-Free Codes and Permutations

SIAM Journal on Discrete Mathematics
Families of Graph-different Hamilton Paths

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We call two permutations of the first n naturals colliding if they map at least one number to consecutive naturals. We give bounds for the exponential asymptotics of the largest cardinality of any set of pairwise colliding permutations of [n]. We relate this problem to the determination of the Shannon capacity of an infinite graph and initiate the study of analogous problems for infinite graphs with finite chromatic number.