Horn renamability and hypergraphs

被引：1
|
作者：
Hvalica, Dušan [1 ]
机构：
[1] Faculty of Economics, University of Ljubljana, Kardeljeva ploščad 17, Ljubljana,SI - 1000, Slovenia
来源：
Journal of Computing and Information Technology | 2009年 / 17卷 / 04期
关键词：
D O I：
10.2498/cit.1001287
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：307 / 312
相关论文
共 50 条
  • [21] An application of fuzzy hypergraphs and hypergraphs in granular computing
    Wang, Qian
    Gong, Zengtai
    INFORMATION SCIENCES, 2018, 429 : 296 - 314
  • [22] Tiling multipartite hypergraphs in quasi-random hypergraphs
    Ding, Laihao
    Han, Jie
    Sun, Shumin
    Wang, Guanghui
    Zhou, Wenling
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 160 : 36 - 65
  • [23] Extremal problems for convex geometric hypergraphs and ordered hypergraphs
    Furedi, Zoltan
    Jiang, Tao
    Kostochka, Alexandr
    Mubayi, Dhruv
    Verstraete, Jacques
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 2021, 73 (06): : 1648 - 1666
  • [24] Hypergraphs with vanishing Turan density in uniformly dense hypergraphs
    Reiher, Christian
    Roedl, Vojtech
    Schacht, Mathias
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2018, 97 : 77 - 97
  • [25] Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities
    Contreras-Aso, Gonzalo
    Criado, Regino
    Romance, Miguel
    JOURNAL OF COMPLEX NETWORKS, 2024, 12 (04)
  • [26] NICHE HYPERGRAPHS
    Garske, Christian
    Sonntag, Martin
    Teichert, Hanns-Martin
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (04) : 819 - 832
  • [27] AN INVARIANT FOR HYPERGRAPHS
    王建方
    李东
    Acta Mathematicae Applicatae Sinica(English Series), 1996, (02) : 113 - 120
  • [28] Complex hypergraphs
    Vazquez, Alexei
    PHYSICAL REVIEW E, 2023, 107 (02)
  • [29] Intersections of hypergraphs
    Bollobas, Bela
    Scott, Alex
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 110 : 180 - 208
  • [30] ON UNAVOIDABLE HYPERGRAPHS
    CHUNG, FRK
    ERDOS, P
    JOURNAL OF GRAPH THEORY, 1987, 11 (02) : 251 - 263
12345