Non-three-colourable common graphs exist
type: Item
instance of: scholarly article
zbMATH Open document ID: 1248.05090
DOI: 10.1017/S0963548312000107
author: Hamed Hatami
author: Jan Hladký
author: Daniel Král'
author: Serguei Norine
author: Alexander Razborov
published in: Combinatorics, Probability and Computing
publication date: 2012-09-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1105.0307
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6081449
zbMATH Keywords: common graphs
zbMATH Keywords: number of copies
zbMATH Keywords: 5-wheel
Wikidata QID: Q57601388
MaRDI profile type: Publication
arXiv ID: 1105.0307
cites work: Hypergraphs Do Jump
cites work: Flag algebras
cites work: Graph norms and Sidorenko's conjecture
cites work: On Sets of Acquaintances and Strangers at any Party
cites work: Q4885227
cites work: A Disproof of a Conjecture of Erdős in Ramsey Theory
cites work: A correlation inequality for bipartite graphs
cites work: Graphs containing triangles are not 3-common
cites work: An approximate version of Sidorenko's conjecture
cites work: Quasi-random graphs
cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations
cites work: On the Ramsey multiplicities of graphs—problems and recent results
cites work: Multiplicities of subgraphs
DBLP publication ID: journals/cpc/HatamiHKNR12
title: Non-three-colourable common graphs exist
description: scientific article; zbMATH DE number 6081449