Pairwise colliding permutations and the capacity of infinite graphs

DOI10.1137/050632877zbMath1110.05004OpenAlexW2040191530MaRDI QIDQ5470827

János Körner, Claudia Malvenuto

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050632877

zbMATH Keywords

extremal combinatoricsShannon capacity of graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (05C99) Coding theorems (Shannon theory) (94A24)

Related Items (10)

Maximum size of a family of pairwise graph-different permutations ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Connector families of graphs ⋮ Triangle-different Hamiltonian paths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interlocked Permutations ⋮ Divergent permutations ⋮ On types of growth for graph-different permutations ⋮ On $k$-Neighbor Separated Permutations

This page was built for publication: Pairwise colliding permutations and the capacity of infinite graphs