The Turan number of directed paths and oriented cycles

被引:0
|
作者
Zhou, Wenling [1 ,2 ]
Li, Binlong [3 ]
机构
[1] Shandong Univ, Sch Math, Jinan 250100, Peoples R China
[2] Univ Paris Saclay, Lab Interdisciplinaire Sci Numer, Gif Sur Yvette, France
[3] Northwestern Polytech Univ, Sch Math & Stat, Xian 710072, Peoples R China
关键词
Turan number; Directed path; Directed cycle; Extremal digraph; BIPARTITE GRAPHS; EXTREMAL GRAPHS; DIGRAPHS; LENGTH;
D O I
10.1007/s00373-023-02647-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Brown et al. (J Combin Theory Ser B 15(1):77-93, 1973) considered Turan-type extremal problems for digraphs. However, to date there are very few results on this problem, even asymptotically. Let (P-2,P-2) over right arrow be the orientation of C-4 which consists of two 2-paths with the same initial and terminal vertices. Huang and Lyu [Discrete Math., 343 (5) (2020)] recently determined the Turan number of (P-2,P-2) over right arrow, and considered it amore natural and interesting problem to determine the Turan number of directed cycles. Let (P-k) over right arrow and (C-k) over right arrow denote the directed path and the directed cycle of order k, respectively. In this paper we determine the maximum size of (C-k) over right arrow -free digraphs of order n for all n, k is an element of N*, as well as the extremal digraphs attaining this maximum size. Similar result is obtained for (P-k) over right arrow k where n is large. In addition, we generalize the result of Huang and Lyu by characterizing the extremal digraphs avoiding an arbitrary orientation of C-4 except (P-2,P-2) over right arrow. In particular, for oriented even cycles, we classify which oriented even cycles inherit the difficulty of their underlying graphs and which do not.
引用
收藏
页数:24
相关论文
共 50 条
  • [21] Matchings of cycles and paths in directed graphs
    Pap, Gyula
    Szego, Laszlo
    COMBINATORICA, 2007, 27 (03) : 383 - 398
  • [22] Approximating longest directed paths and cycles
    Björklund, A
    Husfeldt, T
    Khanna, S
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 222 - 233
  • [23] Matchings of cycles and paths in directed graphs
    Gyula Pap
    László Szegő
    Combinatorica, 2007, 27 : 383 - 398
  • [24] LONG PATHS AND CYCLES IN ORIENTED GRAPHS
    JACKSON, B
    JOURNAL OF GRAPH THEORY, 1981, 5 (02) : 145 - 157
  • [25] SUBGRAPH SUMMABILITY NUMBER OF PATHS AND CYCLES
    Cochran, David V.
    Doshi, Raj J.
    Larson-Koester, Miriam R.
    Ligo, Richard G.
    Narayan, Sivaram K.
    Webstert, Jordan D.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2012, 9 (02) : 135 - 143
  • [26] RAINBOW TURAN NUMBER OF EVEN CYCLES, REPEATED PATTERNS AND BLOW-UPS OF CYCLES
    Janzer, Oliver
    ISRAEL JOURNAL OF MATHEMATICS, 2023, 253 (02) : 813 - 840
  • [27] Real Number Labelings for Paths and Cycles
    Griggs, Jerrold R.
    Jin, Xiaohua Teresa
    INTERNET MATHEMATICS, 2007, 4 (01) : 65 - 86
  • [28] Chromatic layout number of paths and cycles
    Quadras, Jasintha
    Vasanthika, S.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 92 : 167 - 174
  • [29] On the radio number for corona of paths and cycles
    Niranjan, P. K.
    Kola, Srinivasa Rao
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (01) : 269 - 275
  • [30] DIGRAPHS WITH MAXIMUM NUMBER OF PATHS AND CYCLES
    PERL, Y
    NETWORKS, 1987, 17 (03) : 295 - 305