Embedding Graphs into Colored Graphs

DOI10.2307/2000770zbMath0659.03029OpenAlexW4239977340MaRDI QIDQ3808084

Péter Komjáth, Andras Hajnal

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2000770

zbMATH Keywords

induced monocolored copy

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Other combinatorial set theory (03E05)

Related Items (5)

A consistent edge partition theorem for infinite graphs ⋮ Same graph, different universe ⋮ Ramsey partitions of metric spaces ⋮ Embedding finite graphs into graphs colored with infinitely many colors ⋮ Universal elements and the complexity of certain classes of infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring of universal graphs
• Set theory. An introduction to independence proofs
• Proper forcing
• Colouring without triangles and partition relation
• Aspects of constructibility
• Partitionstheoreme für Graphen
• The Colouring Number
• A new class of order types
• On a Probabilistic Graph-Theoretical Method
• On chromatic number of graphs and set-systems
• On decomposition of graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• A proof (involving Martin's axiom) of a partition relation

This page was built for publication: Embedding Graphs into Colored Graphs