Subgraph Statistics for Geometric Graphs
MetadataShow full item record
We determine the asymptotics logorithmic density of subgraphs of large geometric graphs and of some large sparse graphs (from a nowhere dense class). This also leads to a unified approach to graph limits for both sparse and dense classes. Joint work with Patrice Ossona de Mendez, Paris.