Connectivity of friends-and-strangers graphs on random pairs
From MaRDI portal
Publication:2111926
DOI10.1016/J.DISC.2022.113266OpenAlexW4309734294MaRDI QIDQ2111926FDOQ2111926
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
Recommendations
- 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
- scientific article; zbMATH DE number 903461
- Connectedness of friends-and-strangers graphs of complete bipartite graphs and others
- scientific article; zbMATH DE number 6930592
- The friendship paradox
- Publication:3203053
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Subgraphs of graphs. I
- The probabilistic method
- Graph puzzles, homotopy, and the alternating group
- Edge disjoint placement of graphs
- 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
Cited In (6)
- Friends and strangers walking on graphs
- Friends and strangers walking on graphs
- On the diameters of friends-and-strangers graphs
- Connectivity of friends-and-strangers graphs on random pairs
- 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
This page was built for publication: Connectivity of friends-and-strangers graphs on random pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111926)