Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

NOTES ON SOME ERDŐS–HAJNAL PROBLEMS

From MaRDI portal
Publication:5015726
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5015726&oldid=19473492"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki