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 条

[31] A NOTE ON MAXIMAL TRIANGLE-FREE GRAPHS
GODDARD, W
KLEITMAN, DJ
[J]. JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 629 - 631
[32] A note on triangle-free and bipartite graphs
Prömel, HJ
Schickinger, T
Steger, A
[J]. DISCRETE MATHEMATICS, 2002, 257 (2-3) : 531 - 540
[33] On existentially complete triangle-free graphs
Shoham Letzter
Julian Sahasrabudhe
[J]. Israel Journal of Mathematics, 2020, 236 : 591 - 601
[34] The number of the maximal triangle-free graphs
Balogh, Jozsef
Petrickova, Sarka
[J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2014, 46 : 1003 - 1006
[35] Coloring triangle-free graphs on surfaces
Dvorak, Zdenek
Kral, Daniel
Thomas, Robin
[J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 2 - +
[36] The Generation of Maximal Triangle-Free Graphs
Stephan Brandt
Gunnar Brinkmann
Thomas Harmuth
[J]. Graphs and Combinatorics, 2000, 16 (2) : 149 - 157
[37] Induced trees in triangle-free graphs
Matousek, Jiri
Samal, Robert
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
[38] Structure and colour in triangle-free graphs
Aravind, N. R.
Cambie, Stijn
van Batenburg, Wouter Cames
de Verclos, Remi De Joannis
Kang, Ross J.
Patel, Viresh
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
[39] The generation of maximal triangle-free graphs
Brandt, S
Brinkmann, G
Harmuth, T
[J]. GRAPHS AND COMBINATORICS, 2000, 16 (02) : 149 - 157
[40] THE χ-RAMSEY PROBLEM FOR TRIANGLE-FREE GRAPHS
Davies, Ewan
Illingworth, Freddie
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 1124 - 1134

← 1 2 3 4 5 →