Paths with two blocks in oriented graphs of large minimum semi-degree

DOI10.37236/13005MaRDI QIDQ6864222zbMATH OpenFDO

Authors Bin Chen, Xinmin Hou, X. Y. Zhou

Publication date 4 February 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13005

zbMATH Keywords

Erdős-Sós conjectureextremal graph theoryLoebl-Komós-Sós conjecture

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites work

• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected subgraphs of oriented graphs
• Antipaths in oriented graphs
• Arbitrary orientations of Hamilton cycles in oriented graphs
• Hamilton Cycles in Oriented Graphs
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3150485 (Why is no real title available?)
• scientific article; zbMATH DE number 3784924 (Why is no real title available?)
• scientific article; zbMATH DE number 3632516 (Why is no real title available?)
• scientific article; zbMATH DE number 1047732 (Why is no real title available?)
• scientific article; zbMATH DE number 3013308 (Why is no real title available?)
• Long antipaths and anticycles in oriented graphs
• Long paths and cycles in oriented graphs
• On Subtournaments of a Tournament
• Sufficient Conditions for Circuits in Graphs^†
• Tree containment and degree conditions

This page was built for publication: Paths with two blocks in oriented graphs of large minimum semi-degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864222)