REALIZATION OF HYPERGRAPHS WITH BOUNDED PARAMETERS

被引：0
|
作者：
SARVANOV, VI
机构：
来源：
DOKLADY AKADEMII NAUK BELARUSI | 1994年 / 38卷 / 06期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
It is shown that the minimal realization of hypergraph by a graph can be found
引用
收藏
页码：9 / 12
页数：4
相关论文
共 50 条
  • [21] Simplicial Homeomorphs and Trace-Bounded Hypergraphs
    Long, Jason
    Narayanan, Bhargav
    Yap, Corrine
    DISCRETE ANALYSIS, 2022, : 1 - 12
  • [22] EDGE SEARCH IN GRAPHS AND HYPERGRAPHS OF BOUNDED RANK
    ALTHOFER, I
    TRIESCH, E
    DISCRETE MATHEMATICS, 1993, 115 (1-3) : 1 - 9
  • [23] CONTROLLABLE REALIZATION, BOUNDED REALIZATION AND STABLE REALIZATION OF IMPULSE RESPONSE MATRICES
    INOUE, Y
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1971, 54 (12): : 97 - 105
  • [24] Realization for tensor products of Leavitt path algebras of hypergraphs
    Wu, Meiqin
    Le, Jue
    Li, Huanhuan
    COMMUNICATIONS IN ALGEBRA, 2025, 53 (05) : 1978 - 1994
  • [25] A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs
    Hickok, Abigail
    Kureh, Yacoub
    Brooks, Heather Z.
    Feng, Michelle
    Porter, Mason A.
    SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2022, 21 (01): : 1 - 32
  • [26] Realization of set functions as cut functions of graphs and hypergraphs
    Fujishige, S
    Patkar, SB
    DISCRETE MATHEMATICS, 2001, 226 (1-3) : 199 - 210
  • [27] Bounded quantifier depth spectrum for random uniform hypergraphs
    Popova, S. N.
    DISCRETE APPLIED MATHEMATICS, 2024, 345 : 215 - 225
  • [28] COLOR-BOUNDED HYPERGRAPHS, III: MODEL COMPARISON
    Bujtas, Csilla
    Tuza, Zsolt
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2007, 1 (01) : 36 - 55
  • [29] On the number of graphs and h-hypergraphs with bounded diameter
    Tomescu, I
    DISCRETE MATHEMATICS, 2001, 235 (1-3) : 291 - 299
  • [30] Fractional covers of hypergraphs with bounded multi-intersection
    Gottlob, Georg
    Lanzinger, Matthias
    Pichler, Reinhard
    Razgon, Igor
    THEORETICAL COMPUTER SCIENCE, 2023, 979
12345