The use of elementary substructures in combinatorics

DOI10.1016/0012-365X(95)90789-NMaRDI QIDQ1344620zbMATH OpenOpenAlexFDO

Authors 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

elementary substructureErdős-Rado partition theoreminfinite graphstree partition propertyuncountably chromatic subgraphs of the Specker graph

Mathematics Subject Classification ID

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

Review text

The technique of arguments utilizing the elementary substructure method is illustrated by a proof of the Erdős-Rado partition theorem, by a result (given by Erdős, Hajnal, Milner) on the nonseparatedness of uncountably chromatic subgraphs of the Specker graph and by a theorem (of Milner and Komjáth) on a tree partition property of the Specker graph.

Recommendations

• Elementary submodels in infinite combinatorics
• scientific article; zbMATH DE number 1943973
• Two remarks on Ramsey's theorem
• Infinite combinatorics plain and simple
• A polarized partition relation using elementary substructures

Cites work

• A partition calculus in set theory
• scientific article; zbMATH DE number 3148408 (Why is no real title available?)
• scientific article; zbMATH DE number 3286895 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Monochromatic trees with respect to edge partitions
• On a conjecture of Rödl and Voigt
• On chromatic number of graphs and set-systems
• On the existence of two non-neighboring subgraphs in a graph
• Teilmengen von Mengen mit Relationen

Cited in

(8)

• Elementary submodels in infinite combinatorics
• A polarized partition relation using elementary substructures
• A polarized partition relation for weakly compact cardinals using elementary substructures
• Infinite combinatorics plain and simple
• Some combinatorial principles defined in terms of elementary submodels
• A theory of stationary trees and the balanced Baumgartner-Hajnal-Todorcevic theorem for trees
• On a problem of El-Zahar and Erdős
• Davies's theorem and the coloring number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344620)