On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
From MaRDI portal
Publication:6074668
DOI10.1002/rsa.21010zbMath1522.05425arXiv1904.07682OpenAlexW3160710271MaRDI QIDQ6074668
Fan Wei, Jacob Fox, Lisa Sauermann
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.07682
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the inducibility of 4-vertex graphs
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- The inducibility of graphs
- A bound on the inducibility of cycles
- On the exact maximum induced density of almost all graphs and their inducibility
- On the inducibility of cycles
- The expected number of random elements to generate a finite Abelian group
This page was built for publication: On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices