{"id":"https://openalex.org/W4416802203","doi":"https://doi.org/10.37236/13005","title":"Paths with Two Blocks in Oriented Graphs of Large Minimum Semi-Degree","display_name":"Paths with Two Blocks in Oriented Graphs of Large Minimum Semi-Degree","publication_year":2025,"publication_date":"2025-11-28","ids":{"openalex":"https://openalex.org/W4416802203","doi":"https://doi.org/10.37236/13005"},"language":null,"primary_location":{"id":"doi:10.37236/13005","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13005","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p58/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p58/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011893427","display_name":"Bin Chen","orcid":"https://orcid.org/0000-0003-1522-2039"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bin Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068315573","display_name":"Xinmin Hou","orcid":"https://orcid.org/0000-0002-7634-0250"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinmin Hou","raw_affiliation_strings":["University of Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Science and Technology of China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029571874","display_name":"Xinyu Zhou","orcid":"https://orcid.org/0000-0003-1399-828X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinyu Zhou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34011337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5267999768257141,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5267999768257141,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.20350000262260437,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.13699999451637268,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7188000082969666},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5756999850273132},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5196999907493591},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45750001072883606},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45590001344680786},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.40380001068115234},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.34220001101493835}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7504000067710876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7379000186920166},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7188000082969666},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5756999850273132},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5564000010490417},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45750001072883606},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45590001344680786},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.29420000314712524},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.28519999980926514},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.2563999891281128},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/13005","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13005","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p58/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2512.04423","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.04423","pdf_url":"https://arxiv.org/pdf/2512.04423","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/13005","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13005","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p58/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1937537291","display_name":null,"funder_award_id":"2023YFA1010200","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G3857364911","display_name":null,"funder_award_id":"2021ZD0302902","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5819505377","display_name":"\u56fe\u4e0e\u8d85\u56fe\u9576\u5d4c\u3001\u8986\u76d6\u53ca\u8986\u76d6\u6761\u4ef6\u4e0b\u6781\u503c\u95ee\u9898\u7814\u7a76","funder_award_id":"12071453","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416802203.pdf","grobid_xml":"https://content.openalex.org/works/W4416802203.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Stein":[0],"(2020)":[1],"conjectured":[2],"that":[3,39],"for":[4,67],"any":[5,68],"positive":[6],"integer":[7],"$k$,":[8],"every":[9,19,40],"oriented":[10,20,41,69,79],"graph":[11,42],"of":[12,22,43,53,63,77],"minimum":[13,44],"semi-degree":[14,45],"greater":[15],"than":[16],"$k/2$":[17,48],"contains":[18],"path":[21,52,70,80],"length":[23,54],"$k$.":[24,55],"This":[25],"conjecture":[26,65],"is":[27],"true":[28],"by":[29],"a":[30,50,75,84],"result":[31],"from":[32],"Jackson":[33],"(JGT,":[34],"1981),":[35],"where":[36],"he":[37],"demonstrated":[38],"at":[46],"least":[47],"includes":[49],"directed":[51,86],"In":[56],"this":[57],"paper,":[58],"we":[59],"establish":[60],"the":[61],"validity":[62],"Stein's":[64],"specifically":[66],"with":[71],"two":[72],"blocks,":[73],"where,":[74],"block":[76],"an":[78],"$P$":[81],"refers":[82],"to":[83],"maximal":[85],"subpath":[87],"within":[88],"$P$.":[89]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-11-28T00:00:00"}