{"title":"关于梯子的边缘-厄尔多斯-波萨特性","authors":"Raphael Steck, Arthur Ulmer","doi":"10.1007/s00373-024-02765-w","DOIUrl":null,"url":null,"abstract":"<p>We prove that the ladder with 3 rungs and the house graph have the edge-Erdős–Pósa property, while ladders with 14 rungs or more have not. Additionally, we prove that the latter bound is optimal in the sense that the only known counterexample graph does not permit a better result.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Edge-Erdős–Pósa Property of Ladders\",\"authors\":\"Raphael Steck, Arthur Ulmer\",\"doi\":\"10.1007/s00373-024-02765-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We prove that the ladder with 3 rungs and the house graph have the edge-Erdős–Pósa property, while ladders with 14 rungs or more have not. Additionally, we prove that the latter bound is optimal in the sense that the only known counterexample graph does not permit a better result.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00373-024-02765-w\",\"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://doi.org/10.1007/s00373-024-02765-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We prove that the ladder with 3 rungs and the house graph have the edge-Erdős–Pósa property, while ladders with 14 rungs or more have not. Additionally, we prove that the latter bound is optimal in the sense that the only known counterexample graph does not permit a better result.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
