NOTES ON SOME ERDŐS–HAJNAL PROBLEMS

DOI10.1017/jsl.2021.56zbMath1490.03025OpenAlexW4206671527MaRDI QIDQ5015726

Péter Komjáth

Publication date: 9 December 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2021.56

zbMATH Keywords

forcingtreesinfinite graphs

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Cites Work

• Unnamed Item
• Unnamed Item
• Can you take Solovay's inaccessible away?
• Colouring without triangles and partition relation
• Forcing Positive Partition Relations
• Trees, subtrees and order types
• Aronszajn trees and the independence of the transfer property

This page was built for publication: NOTES ON SOME ERDŐS–HAJNAL PROBLEMS