The use of elementary substructures in combinatorics

DOI10.1016/0012-365X(95)90789-NzbMath0819.04006OpenAlexW2092052154MaRDI QIDQ1344620

Eric C. Milner

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

zbMATH Keywords

infinite graphselementary substructureErdős-Rado partition theoremtree partition propertyuncountably chromatic subgraphs of the Specker graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teilmengen von Mengen mit Relationen
• On the existence of two non-neighboring subgraphs in a graph
• Monochromatic trees with respect to edge partitions
• On a conjecture of Rödl and Voigt
• A partition calculus in set theory
• On chromatic number of graphs and set-systems

This page was built for publication: The use of elementary substructures in combinatorics