On String Graph Limits and the Structure of a Typical String Graph

被引：4
|
作者：
Janson, Svante [1 ]
Uzzell, Andrew J. [1 ]
机构：
[1] Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden
来源：
JOURNAL OF GRAPH THEORY | 2017年 / 84卷 / 04期
关键词：
hereditary property; graph limits; string graph; INTERSECTION GRAPHS; NUMBER; HEREDITARY; SEQUENCES;
D O I：
10.1002/jgt.22031
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码：386 / 407
页数：22
相关论文
共 50 条
  • [21] Judgment of static life and death in computer go using string graph
    Park, HS
    Kang, KW
    Kim, HJ
    ADVANCES IN NATURAL COMPUTATION, PT 2, PROCEEDINGS, 2005, 3611 : 543 - 551
  • [22] From little string free energies towards modular graph functions
    Stefan Hohenegger
    Journal of High Energy Physics, 2020
  • [23] Detection of Heap-Spraying Attacks Using String Trace Graph
    Song, Jaehyeok
    Song, Jonghyuk
    Kim, Jong
    INFORMATION SECURITY APPLICATIONS, WISA 2014, 2015, 8909 : 17 - 26
  • [24] Finding a Maximum Clique in a Grounded 1-Bend String Graph
    Keil J.M.
    Mondal D.
    Moradi E.
    Nekrich Y.
    Journal of Graph Algorithms and Applications, 2022, 26 (04) : 553 - 575
  • [25] Higher Genus Modular Graph Functions, String Invariants, and their Exact Asymptotics
    Eric D’Hoker
    Michael B. Green
    Boris Pioline
    Communications in Mathematical Physics, 2019, 366 : 927 - 979
  • [26] Higher Genus Modular Graph Functions, String Invariants, and their Exact Asymptotics
    D'Hoker, Eric
    Green, Michael B.
    Pioline, Boris
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2019, 366 (03) : 927 - 979
  • [27] GAMS: Genome Assembly on Multi-GPU using String Graph
    Jain, Gaurav
    Rathore, Lalchand
    Paul, Kolin
    PROCEEDINGS OF 2016 IEEE 18TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS; IEEE 14TH INTERNATIONAL CONFERENCE ON SMART CITY; IEEE 2ND INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS), 2016, : 348 - 355
  • [28] From little string free energies towards modular graph functions
    Hohenegger, Stefan
    JOURNAL OF HIGH ENERGY PHYSICS, 2020, 2020 (03)
  • [29] STRING GRAMMARS WITH DISCONNECTING OR A BASIC ROOT OF THE DIFFICULTY IN GRAPH GRAMMAR PARSING
    LANGE, KJ
    WELZL, E
    DISCRETE APPLIED MATHEMATICS, 1987, 16 (01) : 17 - 30
  • [30] Approximate Matching of Neighborhood Subgraphs: An Ordered String Graph Levenshtein Method
    Nettleton, David F.
    Salas, Julian
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2016, 24 (03) : 411 - 431
12345