On the evolution of triangle-free graphs

被引：7

作者：

Steger, A ^{[1
]}

机构：

[1] ETH, Inst Theoret Comp Sci, CH-8092 Zurich, Switzerland

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2005年 / 14卷 / 1-2期

关键词：

D O I：

10.1017/S0963548304006613

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let T(n,m) denote the set of all labelled triangle-free graphs with n vertices and exactly in edges. In this paper we give a short self-contained proof of the fact that there exists a constant C > 0 such that, for all m >= Cn(3/2) root logn, a graph chosen uniformly at random from T(n, m) is with probability 1 - o(1) bipartite.

引用

页码：211 / 224

页数：14

共 50 条

[1] Median graphs and triangle-free graphs
Imrich, W
Klavzar, S
Mulder, HM
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) : 111 - 118
[2] Triangle-free equimatchable graphs
Buyukcolak, Yasemin
Ozkan, Sibel
Gozupek, Didem
[J]. JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 461 - 484
[3] Triangle-free polyconvex graphs
Isaksen, DC
Robinson, B
[J]. ARS COMBINATORIA, 2002, 64 : 259 - 263
[4] ON MAXIMAL TRIANGLE-FREE GRAPHS
ERDOS, P
HOLZMAN, R
[J]. JOURNAL OF GRAPH THEORY, 1994, 18 (06) : 585 - 594
[5] On triangle-free random graphs
Luczak, T
[J]. RANDOM STRUCTURES & ALGORITHMS, 2000, 16 (03) : 260 - 276
[6] On triangle-free projective graphs
Hazan, S
[J]. ALGEBRA UNIVERSALIS, 1996, 35 (02) : 185 - 196
[7] CYCLES IN TRIANGLE-FREE GRAPHS
Li, Xiaojuan
Wei, Bing
Zhu, Yongjin
[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (03) : 343 - 356
[8] The diagnosability of triangle-free graphs
Lin, Cheng-Kuan
Teng, Yuan-Hsiang
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 530 : 58 - 65
[9] TOUGHNESS AND TRIANGLE-FREE GRAPHS
BAUER, D
VANDENHEUVEL, J
SCHMEICHEL, E
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 65 (02) : 208 - 221
[10] THE SPECTRUM OF TRIANGLE-FREE GRAPHS
Balogh, Jozsef
Clemen, Felix Christian
Lidick, Bernard
Norin, Sergey
Volec, Jan
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 1173 - 1179

← 1 2 3 4 5 →