21829 articles – 15616 Notices  [english version]

hal-00681907, version 1

On types of growth for graph-different permutations

János Körner 1, Gábor Simonyi 2, Blerina Sinaimeri (Auteur à contacter de préférence) 1

J. Comb. Theory, Ser. A 116, 3 (2009) 713-723

Résumé : We consider an infinite graph $G$ whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of $[n]$ any pair of which differ somewhere in a pair of adjacent vertices of $G$ and determine it completely in an interesting special case. We give estimates for other cases and compare the results in case of complementary graphs. We also explore the close relationship between our problem and the concept of Shannon capacity "within a given type."

  • 1 :  Università di Roma "La Sapienza"
  • Universita di Roma "La Sapienza"
  • 2 :  Alfréd Rényi Institute of Mathematics
  • Hungarian Academy of Sciences
  • Domaine : Informatique/Mathématique discrète
    Informatique/Théorie de l'information et codage
    Mathématiques/Théorie de l'information et codage
  • Mots-clés : Extremal combinatorics – Permutations – Shannon capacity of graphs
 
  • hal-00681907, version 1
  • http://hal.archives-ouvertes.fr/hal-00681907
  • oai:hal.archives-ouvertes.fr:hal-00681907
  • Contributeur : Blerina Sinaimeri <>
  • Soumis le : Jeudi 22 Mars 2012, 17:34:52
  • Dernière modification le : Vendredi 12 Octobre 2012, 14:59:45