{"title":"在固定边密度图中最长轨迹的最小长度","authors":"Vajk Szécsi","doi":"10.2478/s11533-013-0285-x","DOIUrl":null,"url":null,"abstract":"A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).","PeriodicalId":50988,"journal":{"name":"Central European Journal of Mathematics","volume":"7 1","pages":"1831-1837"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the minimal length of the longest trail in a fixed edge-density graph\",\"authors\":\"Vajk Szécsi\",\"doi\":\"10.2478/s11533-013-0285-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).\",\"PeriodicalId\":50988,\"journal\":{\"name\":\"Central European Journal of Mathematics\",\"volume\":\"7 1\",\"pages\":\"1831-1837\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Central European Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/s11533-013-0285-x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Central European Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/s11533-013-0285-x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the minimal length of the longest trail in a fixed edge-density graph
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
