{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:02Z","timestamp":1753893842109,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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 permutations for various graphs $G$. We show that for all balanced bipartite graphs $G$ of order $n$ with minimum degree $n\/2 - o(n)$, the maximum number of pairwise $G$-different permutations of the vertices of $G$ is $2^{(1-o(1))n}$. We also present examples of bipartite graphs $G$ with maximum degree $O(\\log n)$ that have this property. We explore the problem of bounding the maximum size of a family of pairwise graph-different permutations when an unlimited number of disjoint vertices is added to a given graph. We determine this exact value for the graph of 2 disjoint edges, and present some asymptotic bounds relating to this value for graphs consisting of the union of $n\/2$ disjoint edges.<\/jats:p>","DOI":"10.37236\/6885","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:43:36Z","timestamp":1578671016000},"source":"Crossref","is-referenced-by-count":1,"title":["Maximum Size of a Family of Pairwise Graph-Different Permutations"],"prefix":"10.37236","volume":"24","author":[{"given":"Louis","family":"Golowich","sequence":"first","affiliation":[]},{"given":"Chiheon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,10,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p22\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p22\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:44:42Z","timestamp":1579236282000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i4p22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/6885","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,10,20]]},"article-number":"P4.22"}}