There is no fast method for finding monochromatic complete subgraphs

DOI10.1016/0095-8956(83)90006-0zbMath0516.05029OpenAlexW2086631032MaRDI QIDQ1052332

József Beck

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90006-0

zbMATH Keywords

monochromatic complete subgraph2-colorationinfinite complete graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Proper colouring painter-builder game ⋮ Coloring random graphs online without creating monochromatic subgraphs ⋮ Some nonstandard Ramsey like applications

Cites Work

• Unnamed Item
• Some remarks on the theory of graphs
• On a combinatorial game

This page was built for publication: There is no fast method for finding monochromatic complete subgraphs