Essentially Infinite Colourings of Graphs

DOI10.1112/S0024610700008796MaRDI QIDQ4520430zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Yoshiharu Kohayakawa, R. H. Schelp

Publication date 13 December 2000

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024610700008796

zbMATH Keywords

Ramsey theoryessentially infinite colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• A large number of \(m\)-coloured complete infinite subgraphs
• Finding unavoidable colorful patterns in multicolored graphs
• A (5,5)-Colouring of K_n with Few Colours
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• The number of Gallai k-colorings of complete graphs

Cited in

(7)

• Exactly m-coloured complete infinite subgraphs
• Embedding finite graphs into graphs colored with infinitely many colors
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• An infinite color analogue of Rado's theorem
• scientific article; zbMATH DE number 1228446 (Why is no real title available?)
• scientific article; zbMATH DE number 2237565 (Why is no real title available?)
• The complexity of infinite \(H\)-colouring

This page was built for publication: Essentially Infinite Colourings of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520430)