Jesús Méndez, Rosalio Reyes, José M. Rodríguez, José M. Sigarreta
{"title":"约翰逊和克奈瑟图的格罗莫夫双曲性","authors":"Jesús Méndez, Rosalio Reyes, José M. Rodríguez, José M. Sigarreta","doi":"10.1007/s00010-024-01076-y","DOIUrl":null,"url":null,"abstract":"<div><p>The concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting combinatorial graphs defined from systems of sets. In this work we compute the precise value of the hyperbolicity constant of every Johnson graph. Also, we obtain good bounds on the hyperbolicity constant of every Kneser graph, and in many cases, we even compute its precise value.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00010-024-01076-y.pdf","citationCount":"0","resultStr":"{\"title\":\"Gromov hyperbolicity of Johnson and Kneser graphs\",\"authors\":\"Jesús Méndez, Rosalio Reyes, José M. Rodríguez, José M. Sigarreta\",\"doi\":\"10.1007/s00010-024-01076-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting combinatorial graphs defined from systems of sets. In this work we compute the precise value of the hyperbolicity constant of every Johnson graph. Also, we obtain good bounds on the hyperbolicity constant of every Kneser graph, and in many cases, we even compute its precise value.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00010-024-01076-y.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00010-024-01076-y\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00010-024-01076-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting combinatorial graphs defined from systems of sets. In this work we compute the precise value of the hyperbolicity constant of every Johnson graph. Also, we obtain good bounds on the hyperbolicity constant of every Kneser graph, and in many cases, we even compute its precise value.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
