Enregistré dans:
Détails bibliographiques
Auteurs principaux: Lu, Junying, Chen, Yaojun
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2509.17756
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915506668175360
author Lu, Junying
Chen, Yaojun
author_facet Lu, Junying
Chen, Yaojun
contents The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum degree does not exceed the minimum degree of $G$. Let $δ^0(D)$ be the minimum semidegree of a digraph $D$ and $Δ(D)$ be the maximum degree of $D$. In this paper, we establish a digraph version of Jiang's result, stating that every oriented graph $D$ of girth at least $2\ell+1$ with $δ^0(D)\ge \max\{k/\ell,Δ(T)\}$ contains every oriented tree with $k$ edges, that answers a question raised by Stein and Trujillo-Negrete in affirmative.
format Preprint
id arxiv_https___arxiv_org_abs_2509_17756
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Oriented trees in digraphs with large girth
Lu, Junying
Chen, Yaojun
Combinatorics
05C20
The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum degree does not exceed the minimum degree of $G$. Let $δ^0(D)$ be the minimum semidegree of a digraph $D$ and $Δ(D)$ be the maximum degree of $D$. In this paper, we establish a digraph version of Jiang's result, stating that every oriented graph $D$ of girth at least $2\ell+1$ with $δ^0(D)\ge \max\{k/\ell,Δ(T)\}$ contains every oriented tree with $k$ edges, that answers a question raised by Stein and Trujillo-Negrete in affirmative.
title Oriented trees in digraphs with large girth
topic Combinatorics
05C20
url https://arxiv.org/abs/2509.17756