t-Pancyclic Arcs in Tournaments
(ندگان)پدیدآور
Meng, WeiGrueter, SteffenGuo, YubaoKapolke, ManuMeesker, Simonنوع مدرک
TextOriginal paper
زبان مدرک
Englishچکیده
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $h^3(T)geq3$ for any non-trivial strong tournament $T$ and characterized the tournaments with $h^3(T)= 3$. In this paper, we generalize Moon's theorem by showing that $h^t(T)geq t$ for every $3leq tleq |V(T)|$ and characterizing the tournaments with $h^t(T)= t$. We also present all tournaments which fulfill $p^t(T)= t$.
کلید واژگان
tournamentpancyclicity
t-pancyclic arc
Graph theory
شماره نشریه
2تاریخ نشر
2019-12-011398-09-10
ناشر
Azarbaijan Shahid Madani Universityسازمان پدید آورنده
School of Mathematical Sciences, Shanxi University, 030006 Taiyuan, ChinaLehrstuhl C fuer Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Lehrstuhl C fuer Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Lehrstuhl C fuer Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Lehrstuhl C fuer Mathematik, RWTH Aachen University, 52056 Aachen, Germany
شاپا
2538-21282538-2136




