Embedding finite graphs into graphs colored with infinitely many colors

DOI10.1007/BF02773844zbMath0741.05028OpenAlexW2101619632MaRDI QIDQ1182823

Andras Hajnal

Publication date: 28 June 1992

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02773844

zbMATH Keywords

coloringfinite graphmonochromatic

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A consistent edge partition theorem for infinite graphs ⋮ King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments

Cites Work

• Partitionstheoreme für Graphen
• Embedding Graphs into Colored Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding finite graphs into graphs colored with infinitely many colors