Complete minors in pseudorandom graphs

被引：0
|
作者：
Thomason, A [1 ]
机构：
[1] DPMMS, Cambridge CB2 1SB, England
来源：
RANDOM STRUCTURES & ALGORITHMS | 2000年 / 17卷 / 01期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Random graphs have the smallest complete miners among all graphs of given order and density. We show that, unlike random graphs, many well-known examples of pseudorandom graphs (such as Paley graphs) have very large miners. (C) 2000 John Wiley & Sons, Inc.
引用
收藏
页码：26 / 28
页数：3
相关论文
共 50 条
  • [1] Interval Minors of Complete Bipartite Graphs
    Mohar, Bojan
    Rafiey, Arash
    Tayfeh-Rezaie, Behruz
    Wu, Hehui
    JOURNAL OF GRAPH THEORY, 2016, 82 (03) : 312 - 321
  • [2] Complete Minors in Graphs Without Sparse Cuts
    Krivelevich, Michael
    Nenadov, Rajko
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2021, 2021 (12) : 8996 - 9015
  • [3] Double-critical graphs and complete minors
    Kawarabayashi, Ken-ichi
    Pedersen, Anders Sune
    Toft, Bjarne
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [4] Complete minors in complements of nonseparating planar graphs
    Fowler, Leonard
    Li, Gregory
    Pavelescu, Andrei
    INVOLVE, A JOURNAL OF MATHEMATICS, 2023, 16 (03): : 505 - 518
  • [5] Rooted Complete Minors in Line Graphs with a Kempe Coloring
    Kriesell, Matthias
    Mohr, Samuel
    GRAPHS AND COMBINATORICS, 2019, 35 (02) : 551 - 557
  • [6] Complete minors in Ks,s-free graphs
    Kühn D.
    Osthus D.
    Combinatorica, 2004, 25 (1) : 49 - 64
  • [7] Rooted Complete Minors in Line Graphs with a Kempe Coloring
    Matthias Kriesell
    Samuel Mohr
    Graphs and Combinatorics, 2019, 35 : 551 - 557
  • [8] FORCING LARGE COMPLETE (TOPOLOGICAL) MINORS IN INFINITE GRAPHS
    Stein, Maya
    Zamora, Jose
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 697 - 707
  • [9] Complete minors in Ks,s-free graphs
    Kühn, D
    Osthus, D
    COMBINATORICA, 2005, 25 (01) : 49 - 64
  • [10] Complete minors in cubic graphs with few short cycles and random cubic graphs
    Markström, K
    ARS COMBINATORIA, 2004, 70 : 289 - 295
12345