{"title":"在数图中存在有两个块的路径","authors":"Amine El Sahili, Maidoun Mortada, Sara Nasser","doi":"10.1007/s00373-024-02759-8","DOIUrl":null,"url":null,"abstract":"<p>We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any <i>n</i>-chromatic digraph <i>D</i>, with <span>\\(n\\ge 4\\)</span>, contains a path with two blocks of order <i>n</i>.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Existence of a Path with Two Blocks in Digraphs\",\"authors\":\"Amine El Sahili, Maidoun Mortada, Sara Nasser\",\"doi\":\"10.1007/s00373-024-02759-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any <i>n</i>-chromatic digraph <i>D</i>, with <span>\\\\(n\\\\ge 4\\\\)</span>, contains a path with two blocks of order <i>n</i>.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-03-12\",\"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-02759-8\",\"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-02759-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们给出了 El Sahili 猜想的一个新的基本证明 El Sahili（《离散数学》287：151-153，2004 年）指出，任何 n 个色度数图 D，在 \(n\ge 4\) 的情况下，都包含一条有两个 n 阶块的路径。
The Existence of a Path with Two Blocks in Digraphs
We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any n-chromatic digraph D, with \(n\ge 4\), contains a path with two blocks of order n.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
