Subgraph Statistics for Geometric Graphs

Loading...
Thumbnail Image
Author(s)
Nesetril, Jaroslav
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Collections
Supplementary to:
Abstract
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.
Sponsor
NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering
Date
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings
Rights Statement
Rights URI