Article Instance

HTTP 200 OK
Allow: GET
Content-Type: application/json
Vary: Accept

{
    "pk": 64803,
    "title": "Friends and strangers walking on graphs",
    "subtitle": null,
    "abstract": "Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, we define a graph $\\mathsf{FS}(X,Y)$ whose vertex set consists of all bijections $\\sigma\\colon V(X)\\to V(Y)$, where two bijections $\\sigma$ and $\\sigma'$ are adjacent if they agree everywhere except for two adjacent vertices $a,b \\in V(X)$ such that $\\sigma(a)$ and $\\sigma(b)$ are adjacent in $Y$. This setup, which has a natural interpretation in terms of friends and strangers walking on graphs, provides a common generalization of Cayley graphs of symmetric groups generated by transpositions, the famous $15$-puzzle, generalizations of the $15$-puzzle as studied by Wilson, and work of Stanley related to flag $h$-vectors. We derive several general results about the graphs $\\mathsf{FS}(X,Y)$ before focusing our attention on some specific choices of $X$. When $X$ is a path graph, we show that the connected components of $\\mathsf{FS}(X,Y)$ correspond to the acyclic orientations of the complement of $Y$. When $X$ is a cycle, we obtain a full description of the connected components of $\\mathsf{FS}(X,Y)$ in terms of toric acyclic orientations of the complement of $Y$. We then derive various necessary and/or sufficient conditions on the graphs $X$ and $Y$ that guarantee the connectedness of $\\mathsf{FS}(X,Y)$. Finally, we raise several promising further questions.\nMathematics Subject Classifications: 05C40, 05C38, 05A05",
    "language": "en",
    "license": {
        "name": "Creative Commons Attribution 4.0",
        "short_name": "CC BY 4.0",
        "text": "Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.\n\nNo additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.",
        "url": "https://creativecommons.org/licenses/by/4.0"
    },
    "keywords": [],
    "section": "Research Articles",
    "is_remote": true,
    "remote_url": "https://escholarship.org/uc/item/7299j21s",
    "frozenauthors": [
        {
            "first_name": "Colin",
            "middle_name": "",
            "last_name": "Defant",
            "name_suffix": "",
            "institution": "Department of Mathematics, Princeton University, Princeton, NJ 08540, U.S.A.",
            "department": ""
        },
        {
            "first_name": "Noah",
            "middle_name": "",
            "last_name": "Kravitz",
            "name_suffix": "",
            "institution": "Department of Mathematics, Princeton University, Princeton, NJ 08540, U.S.A.",
            "department": ""
        }
    ],
    "date_submitted": "2021-11-11T16:59:39Z",
    "date_accepted": "2021-11-11T16:59:39Z",
    "date_published": "2021-12-15T08:00:00Z",
    "render_galley": null,
    "galleys": [
        {
            "label": "",
            "type": "pdf",
            "path": "https://journalpub.escholarship.org/combinatorial_theory/article/64803/galley/49613/download/"
        }
    ]
}