{"title":"Groups, Languages and Automata","authors":"D. Holt, Sarah Rees, Claas E. Röver","doi":"10.1017/9781316588246","DOIUrl":"https://doi.org/10.1017/9781316588246","url":null,"abstract":"","PeriodicalId":448419,"journal":{"name":"London Mathematical Society. Student Texts","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129568480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-04-25DOI: 10.1017/cbo9781316479988
M. Krivelevich, K. Panagiotou, M. Penrose, C. McDiarmid
Editors' introduction Part I. Long Paths and Hamiltonicity in Random Graphs: 1. Introduction 2. Tools 3. Long paths in random graphs 4. The appearance of Hamilton cycles in random graphs References for Part I Part II. Random Graphs from Restricted Classes: 1. Introduction 2. Random trees 3. Random graphs from block-stable classes References for Part II Part III. Lectures on Random Geometric Graphs: 1. Introduction 2. Edge counts 3. Edge counts: normal approximation 4. The maximum degree 5. A sufficient condition for connectivity 6. Connectivity and Hamiltonicity 7. Solutions to exercises References for Part III Part IV. On Random Graphs from a Minor-closed Class: 1. Introduction 2. Properties of graph classes 3. Bridge-addability, being connected and the fragment 4 Growth constants 5. Unlabelled graphs 6. Smoothness 7. Concluding remarks References for Part IV Index.
{"title":"Random Graphs, Geometry and Asymptotic Structure","authors":"M. Krivelevich, K. Panagiotou, M. Penrose, C. McDiarmid","doi":"10.1017/cbo9781316479988","DOIUrl":"https://doi.org/10.1017/cbo9781316479988","url":null,"abstract":"Editors' introduction Part I. Long Paths and Hamiltonicity in Random Graphs: 1. Introduction 2. Tools 3. Long paths in random graphs 4. The appearance of Hamilton cycles in random graphs References for Part I Part II. Random Graphs from Restricted Classes: 1. Introduction 2. Random trees 3. Random graphs from block-stable classes References for Part II Part III. Lectures on Random Geometric Graphs: 1. Introduction 2. Edge counts 3. Edge counts: normal approximation 4. The maximum degree 5. A sufficient condition for connectivity 6. Connectivity and Hamiltonicity 7. Solutions to exercises References for Part III Part IV. On Random Graphs from a Minor-closed Class: 1. Introduction 2. Properties of graph classes 3. Bridge-addability, being connected and the fragment 4 Growth constants 5. Unlabelled graphs 6. Smoothness 7. Concluding remarks References for Part IV Index.","PeriodicalId":448419,"journal":{"name":"London Mathematical Society. Student Texts","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115688429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：