• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Australasian Journal of Combinatorics

    Australasian Journal of Combinatorics

    JournalISSN 1034-4942eISSN 2202-3518中科院 数学 4区

    年发文量

    研究主题

    论文(2617)

    排序
    1A Fuss-Catalan Generalization of the Fine Numbers
    Paul Drube

    Fine paths are a popular modification of Dyck paths that are not allowed to have "hills". Enumerating Fine paths of length 2n are the Fine numbers (F-n)(n >= 0), a well-studied integer sequence that shares many properties with the Catalan numbers. In this paper, we investigate a two-parameter generalization of the Fine numbers known as the (k, r)-Fine numbers (F-n(k,r ) )(n >= 0), with the k parameter (k >= 2) mirroring the generalization of the Catalan numbers to the Fuss-Catalan numbers, and the r parameter (1 <= r <= k-1) corresponding to competing definitions of "hills" in k-Dyck paths. Generating functions are derived for all classes of (k, r)-Fine numbers, and these generating functions are used to generalize many pre-existing results involving the Fine numbers. We also use Riordan arrays to provide an additional combinatorial interpretation of all (k, r)-Fine numbers as certain classes of colored, higher-order Motzkin paths. We close the paper with asymptotic results studying the behavior of the (k, r)-Fine numbers as n -> infinity.

    2026
    引用
    AI阅读
    加入学术空间
    2A Step Toward an S-packing Coloring Conjecture for Subcubic Graphs
    Ayman EL Zein,Maidoun Mortada

    For a non-decreasing sequence of integers S = (s(1), s(2), ..., s(k)), an Spacking coloring of G is a partition of V(G) into k subsets I-1, I-2, ..., I-k such that the distance between any two distinct vertices u, v is an element of I-i is greater than s(i), for any i such that 1 <= i <= k. Gastineau and Togni [Discrete Math. 339 (2016), 2461-2470] asked whether a subcubic graph is (1, 2, 2, 2, 2, 2)-and (1, 1, 2, 3)-packing colorable, except the Petersen graph. Recently, Bre & scaron;ar, Kuenzel, and Rall [Discrete Math. 348(8) (2025), 114477] proved that every claw-free subcubic graph is (1, 1, 2, 2)-packing colorable. The local girth of a vertex v in a graph is the length of the shortest cycle containing v. Hence, a claw-free subcubic graph is a subcubic graph where every vertex of degree 3 has local girth 3. In this paper, we prove that every subcubic graph such that every vertex of degree 3 has local girth at most 4 is (1, 2, 2, 2, 2, 2)-packing colorable.

    2026引用:1
    引用
    AI阅读
    加入学术空间
    3The Crossing Number of the Strong Product of a Path and a Cycle
    Dengju Ma

    Let P-m boxed times C-n be the strong product on P-m and C-n, where P-m and C-n are the path and the cycle on m and n vertices, respectively. In 2018 Ouyang, Wang, and Huang conjectured that the crossing number of P-m boxed times C-n is (m-1)n for m >= 3 and n >= 3. In this paper we confirm the correctness of the conjecture, and we determine the crossing number of a spanning graph of P-m boxed times C-n.

    2026
    引用
    AI阅读
    加入学术空间
    4Watchman's Walk on Complete Multipartite Digraphs
    Sergiy Kozerenko, Bohdan Romanchuk

    A generalized orientation of a graph is the one where both orientations of edges are allowed at the same time. We prove that complete multipartite graphs are characterized by the following property: any generalized orientation without sources has a watchman's walk. We also characterize graphs satisfying this and a related property in the case of simple orientations. Our main result establishes an upper bound for the watchman's number w(D) for complete multipartite digraphs D without sources: w(D) <= gamma(D) + 2 alpha(D), where gamma(D) is the domination number and alpha(D) is the independence number of D. This result extends the upper bound previously established for tournaments by Dyer, Howell and Pittman in 2021.

    2026
    引用
    AI阅读
    加入学术空间
    5Multicolor Connected Ramsey Numbers
    Mark Budden, Monu Moun,Jagjeet Jakhar, Richard Prange

    In this paper we introduce strongly connected t-colorings, which allow us to extend the concept of a connected Ramsey number to the t-color setting, when t >= 3. After proving some general results concerning such colorings, we determine the exact values of the connected Ramsey numbers r(c)(t)(K-1,K-n), r(c)(3)(K1,3, K1,4, K1,4), r(c)(3)(P4), r(c)(3)(P5), and r(c)(3)(P6), where K1,n denotes a star of order n + 1, and Pn denotes a path of order n. The paper concludes with some lower bounds, a conjecture, and a discussion concerning future directions of research.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 2617 篇论文

    高被引作者

    作者引用发文
    Jennifer Seberry102044
    Lutz Volkmann65435
    Mirka Miller51719
    Lou Caccetta48819
    R.E.L. Aldred48421
    Darryn Bryant40818
    Mustapha Chellali40318
    Ming-Yao Xu4016
    Diane Donovan39113
    Brendan McKay3729

    高产作者

    作者引用发文
    Jennifer Seberry102044
    Lutz Volkmann65435
    R.E.L. Aldred48421
    Lou Caccetta48819
    Mirka Miller51719
    Darryn Bryant40818
    Mustapha Chellali40318
    Michael Henning32817
    Nader Jafari Rad33617
    Saad I. El-Zanati29316

    相关期刊

    The Art of Discrete and Applied Mathematics
    Ars Mathematica Contemporanea
    Order
    Journal Of Combinatorial Designs
    Contributions to Discrete Mathematics
    Journal of Integer Sequences
    Discrete Mathematics
    Elemente Der Mathematik
    Graphs and Combinatorics
    arXiv: Combinatorics