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 条
  • [31] Embedding graphs with bounded degree in sparse pseudorandom graphs
    Kohayakawa, Y
    Rödl, V
    Sissokho, P
    ISRAEL JOURNAL OF MATHEMATICS, 2004, 139 (1) : 93 - 137
  • [32] Cliques, minors and apex graphs
    Niu, Jianbing
    Zhang, Cun-Quan
    DISCRETE MATHEMATICS, 2009, 309 (12) : 4095 - 4107
  • [33] Minors in graphs of large girth
    Kühn, D
    Osthus, D
    RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (02) : 213 - 225
  • [34] Compact Topological Minors in Graphs
    Jiang, Tao
    JOURNAL OF GRAPH THEORY, 2011, 67 (02) : 139 - 152
  • [35] Clique minors in graphs and their complements
    Reed, B
    Thomas, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 78 (01) : 81 - 85
  • [36] Coloring graphs with forbidden minors
    Rolek, Martin
    Song, Zi-Xia
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 14 - 31
  • [37] Excluded minors in cubic graphs
    Robertson, Neil
    Seymour, Paul
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 138 : 219 - 285
  • [38] Minors in Chromatic Graphs, II
    Kostochka, A. V.
    JOURNAL OF GRAPH THEORY, 2014, 75 (04) : 377 - 386
  • [39] Topological Minors in Bipartite Graphs
    Balbuena, Camino
    Cera, Martin
    Garcia-Vazquez, Pedro
    Carlos Valenzuela, Juan
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2011, 27 (11) : 2085 - 2100
  • [40] POWERS OF HAMILTON CYCLES IN PSEUDORANDOM GRAPHS
    Allen, Peter
    Bottcher, Julia
    Han, Hiep
    Kohayakawa, Yoshiharu
    Person, Yury
    COMBINATORICA, 2017, 37 (04) : 573 - 616
12345