Work

Two‐Block Paths in Oriented Graphs of Large Semidegree

Year: 2026

Type: article

Abstract: ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers and with , we establish a semidegree function that guarantees the containment of every oriented path with two blocks of sizes and . As a corollary, we show that every oriented graph with all in‐ and out‐degrees at least contains every two‐block path with arcs. Our results extend previous work on Stein's conjecture and related problems concerning oriented paths.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.70131

Authors: Irena Penev, S Taruni, Stéphan Thomassé, Ana Trujillo‐Negrete, Mykhaylo Tyomkyn

Institutions: Charles University, Centre National de la Recherche Scientifique, Center for Mathematical Modeling, University of Chile, Lyon 1 Université, École Normale Supérieure de Lyon, Laboratoire de l'Informatique du Parallélisme, Universidad Nacional Autónoma de México

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funders: European Commission, Grantová Agentura České Republiky, Universidad Nacional Autónoma de México, Agencia Nacional de Investigación y Desarrollo, H2020 European Research Council

Awards: Deterministic processes on graphs and hypergraphs, G1655620280, G2601637665, G2722083710, Randomness and learning in networks, STRUCTURAL GRAPH THEORY FOR TOKEN GRAPHS AND THE TREE CONTAINMENT PROBLEM., CENTER FOR MATHEMATICAL MODELING (CMM)

OpenAlex ID: W4417068964

FWCI:

Cites:

Cited by:

Related to: