Connectivity of friends-and-strangers graphs on random pairs
From MaRDI portal
Publication:2111926
DOI10.1016/j.disc.2022.113266OpenAlexW4309734294MaRDI QIDQ2111926
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.00801
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)
Related Items (2)
Connectedness of friends-and-strangers graphs of complete bipartite graphs and others ⋮ The connectedness of the friends-and-strangers graph of a lollipop and others
Cites Work
- Edge disjoint placement of graphs
- Graph puzzles, homotopy, and the alternating group
- Subgraphs of graphs. I
- Typical and extremal aspects of friends-and-strangers graphs
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- Friends and strangers walking on graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Connectivity of friends-and-strangers graphs on random pairs