Maximum Size of a Family of Pairwise Graph-Different Permutations

Electronic Journal Of Combinatorics

Louis Golowich¹ 

关键词: Extremal combinatorics;    Permutations;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Two permutations of the vertices of a graph $G$ are called $G$-different if there exists an index $i$ such that $i$-th entry of the two permutations form an edge in $G$. We bound or determine the maximum size of a family of pairwise $G$-different permutat

【 授权许可】

Others