Embedding theorems for graphs establishing negative partition relations

DOI10.1007/BF02018087zbMath0381.04004OpenAlexW2049763138MaRDI QIDQ1247324

Andras Hajnal, Paul Erdős

Publication date: 1978

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05C99) Axiomatics of classical set theory and its fragments (03E30) Other combinatorial set theory (03E05)

Related Items

Ramsey theory over partitions III: Strongly Luzin sets and partition relations, A graph which embeds all small graphs on any large set of vertices, Many partition relations below density, Ramsey-type theorems

Cites Work

• Colouring without triangles and partition relation
• Iterated Cohen extensions and Souslin's problem
• Partition relations for cardinal numbers
• Incompactness in languages with infinitely long expressions