Non-Three-Colourable Common Graphs Exist

被引：32

作者：

Hatami, Hamed ^{[1
]}

Hladky, Jan ^{[2
,3
]}

Kral, Daniel ^{[4
]}

Norine, Serguei ^{[5
]}

Razborov, Alexander ^{[6
]}

机构：

[1] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada

[2] Charles Univ Prague, Fac Math & Phys, Dept Appl Math, Prague 11800, Czech Republic

[3] Univ Warwick, Dept Comp Sci, DIMAP, Coventry CV4 7AL, W Midlands, England

[4] Charles Univ Prague, Fac Math & Phys, Inst Theoret Comp Sci, Prague 11800, Czech Republic

[5] Princeton Univ, Dept Math, Princeton, NJ 08544 USA

[6] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2012年 / 21卷 / 05期

基金：

加拿大自然科学与工程研究理事会; 欧洲研究理事会; 英国工程与自然科学研究理事会; 俄罗斯基础研究基金会;

关键词：

D O I：

10.1017/S0963548312000107

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A graph H is called common if the sum of the number of copies of H in a graph G and the number in the complement of G is asymptotically minimized by taking G to be a random graph. Extending a conjecture of Erdos, Burr and Rosta conjectured that every graph is common. Thomason disproved both conjectures by showing that K-4 is not common. It is now known that in fact the common graphs are very rare. Answering a question of Sidorenko and of Jagger, St' ovicek and Thomason from 1996 we show that the 5-wheel is common. This provides the first example of a common graph that is not three-colourable.

引用

页码：734 / 742

页数：9

共 50 条

[41] Improved hardness for H-colourings of G-colourable graphs
Wrochna, Marcin
Zivny, Stanislav
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1426 - 1435
[42] Some equitably 2-colourable cycle decompositions of multipartite graphs
Waterhouse, Mary
UTILITAS MATHEMATICA, 2006, 70 : 201 - 220
[43] Chromatic Number of Graphs each Path of which is 3-colourable
Randerath B.
Schiermeyer I.
Results in Mathematics, 2002, 41 (1-2) : 150 - 155
[44] Preuniquely k-colourable graphs and k-colouring matrices
1991, (27):
[45] Improved hardness for H-colourings of G-colourable graphs
Wrochna, Marcin
Zivny, Stanislav
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1426 - 1435
[46] Nontrivial nuciferous graphs exist
Ghorbani, Ebrahim
ARS MATHEMATICA CONTEMPORANEA, 2016, 11 (02) : 391 - 395
[47] Graphs with girth 9 and without longer odd holes are 3-colourable
Wang, Yan
Wu, Rong
JOURNAL OF GRAPH THEORY, 2024, 106 (04) : 871 - 886
[48] Some equitably 3-colourable cycle decompositions of complete equipartite graphs
Lefevre, J
Waterhouse, M
DISCRETE MATHEMATICS, 2005, 297 (1-3) : 60 - 77
[49] On some parameters related to uniquely vertex-colourable graphs and defining sets
Daneshgar, A
Naserasr, R
ARS COMBINATORIA, 2003, 69 : 301 - 318
[50] Non-Bipartite K-Common Graphs
Kral, Daniel
Noel, Jonathan A.
Norin, Sergey
Volec, Jan
Wei, Fan
COMBINATORICA, 2022, 42 (01) : 87 - 114

← 1 2 3 4 5 →