Graph-Different Permutations

DOI10.1137/070692686zbMath1167.05339arXiv0709.4387OpenAlexW2065300049MaRDI QIDQ3629458

János Körner, Claudia Malvenuto, Gábor Simonyi

Publication date: 27 May 2009

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

Full work available at URL: https://arxiv.org/abs/0709.4387

zbMATH Keywords

permutationsextremal combinatoricsShannon capacity of graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Extremal set theory (05D05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Maximum size of a family of pairwise graph-different permutations ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Triangle-different Hamiltonian paths ⋮ 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: Graph-Different Permutations