Graph-Different Permutations

DOI10.1137/070692686MaRDI QIDQ3629458zbMATH OpenOpenAlexFDO

Authors 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

extremal combinatoricspermutationsShannon capacity of graphs

Mathematics Subject Classification ID

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

Abstract: 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.

Recommendations

• Pairwise colliding permutations and the capacity of infinite graphs
• On types of growth for graph-different permutations
• Maximum size of a family of pairwise graph-different permutations
• Divergent permutations
• Interlocked Permutations

Cited in

(10)

• On types of growth for graph-different permutations
• New bounds on even cycle creating Hamiltonian paths using expander graphs
• Divergent permutations
• Maximum size of a family of pairwise graph-different permutations
• Permutation capacities and oriented infinite paths
• Permuting Web Graphs
• Interlocked Permutations
• On \(k\)-neighbor separated permutations
• Pairwise colliding permutations and the capacity of infinite graphs
• Triangle-different Hamiltonian paths

This page was built for publication: Graph-Different Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629458)