There is no fast method for finding monochromatic complete subgraphs
type: Item
instance of: scholarly article
title: There is no fast method for finding monochromatic complete subgraphs
zbMATH Open document ID: 0516.05029
DOI: 10.1016/0095-8956(83)90006-0
published in: Journal of Combinatorial Theory. Series B
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3815674
zbMATH Keywords: 2-coloration
zbMATH Keywords: infinite complete graph
zbMATH Keywords: monochromatic complete subgraph
author: József Beck
MaRDI profile type: Publication
full work available at URL: 0095-8956(83)90006-0
OpenAlex ID: W2086631032
cites work: Some remarks on the theory of graphs
cites work: On a combinatorial game
cites work: Q4065548
description: scientific article; zbMATH DE number 3815674