Embedding Graphs into Colored Graphs

DOI10.2307/2000770MaRDI QIDQ3808084zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Publication:4732473
• The Colouring Number
• The colouring number of infinite graphs
• A Ramsey-Type Theorem for Orderings of a Graph
• A consistent edge partition theorem for infinite graphs
• scientific article; zbMATH DE number 3987277
• Infinite generalized friendship graphs
• scientific article; zbMATH DE number 3468845
• scientific article; zbMATH DE number 1126841

Cites work

• A new class of order types
• A proof (involving Martin's axiom) of a partition relation
• Aspects of constructibility
• Coloring of universal graphs
• Colouring without triangles and partition relation
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• scientific article; zbMATH DE number 3902684 (Why is no real title available?)
• scientific article; zbMATH DE number 3717358 (Why is no real title available?)
• scientific article; zbMATH DE number 3536154 (Why is no real title available?)
• On a Probabilistic Graph-Theoretical Method
• On chromatic number of graphs and set-systems
• On decomposition of graphs
• Partitionstheoreme für Graphen
• Proper forcing
• Set theory. An introduction to independence proofs
• The Colouring Number

Cited in

(18)

• Coloring of universal graphs
• A graph which embeds all small graphs on any large set of vertices
• Embedding finite graphs into graphs colored with infinitely many colors
• Universal elements and the complexity of certain classes of infinite graphs
• Embedding theorems for graphs establishing negative partition relations
• A consistent edge partition theorem for infinite graphs
• Bipartite graphs and monochromatic squares
• Simultaneous embedding of colored graphs
• Same graph, different universe
• scientific article; zbMATH DE number 3487493 (Why is no real title available?)
• Colored Point-Set Embeddings of Acyclic Graphs
• scientific article; zbMATH DE number 4118372 (Why is no real title available?)
• Constructions of infinite graphs with Ramsey property
• Identities on cardinals less than ℵ_ω
• Ramsey partitions of metric spaces
• Färbungen großer Würfel mit bunten Wegen
• Monocolored topological complete graphs in colorings of uncountable complete graphs
• Complexity issues in color-preserving graph embeddings

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

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