The use of elementary substructures in combinatorics
From MaRDI portal
Publication:1344620
DOI10.1016/0012-365X(95)90789-NzbMath0819.04006OpenAlexW2092052154MaRDI QIDQ1344620
Publication date: 24 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)90789-n
infinite graphselementary substructureErdős-Rado partition theoremtree partition propertyuncountably chromatic subgraphs of the Specker graph
Related Items (4)
On a problem of El-Zahar and Erdős ⋮ A polarized partition relation using elementary substructures ⋮ A theory of stationary trees and the balanced Baumgartner-Hajnal-Todorcevic theorem for trees ⋮ A polarized partition relation for weakly compact cardinals using elementary substructures
Cites Work
This page was built for publication: The use of elementary substructures in combinatorics