New Research Studies Quasi-Random Graphs
New research explores properties of graphs where a restricted count of subgraphs is approximately what is expected in a random graph. The study focuses on subgraph counts and graph limits. The findings contribute to the field of graph theory and its applications.
Topics
Developing
- 907d Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore.
- 907d Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur.
- 907d Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est.
- 907d Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium.
Sources · 7 independent
Modernity/arxiv
“Quasi-random graphs, subgraph counts and graph limits, again. Authors: Svante Janson Abstract: We study properties of graphs (or rather graph sequences) saying that some restricted count of subgraphs is approximatively what is expected in a random graph. It has...”
Unlock the full story
Get a Pro subscription or above to see the live story progression and the full list of independent sources confirming each event as they happen.
Log in to upgrade