Connectivity of old and new models of friends-and-strangers graphs
From MaRDI portal
Publication:6153616
DOI10.1016/j.aam.2023.102668arXiv2210.03864OpenAlexW4391067188MaRDI QIDQ6153616
Publication date: 14 February 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.03864
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Combinatorial probability (60C05) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Acyclic orientations of random graphs
- Graph puzzles, homotopy, and the alternating group
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- Reversible computation using swap reactions on a surface
- An equivalence relation on the symmetric group and multiplicity-free flag \(h\)-vectors
- Toric partial orders
- Friends and strangers walking on graphs
- Packing random graphs and hypergraphs
This page was built for publication: Connectivity of old and new models of friends-and-strangers graphs