scientific article; zbMATH DE number 15458

MaRDI QIDQ3972096zbMATH OpenFDO

Authors G. D. Badenhorst, Karl-Theodor Sturm

Publication date 25 June 1992

zbMATH Keywords

graph propertyweakly compact cardinals

Mathematics Subject Classification ID

Large cardinals (03E55) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Combinatorics of partially ordered sets (06A07)

Review text

[For the entire collection see Zbl 0699.00016.] It is proved that an uncountable cardinal \(\kappa\) has the graph property, i.e. every graph of size \(\kappa\) contains either a complete or an empty subgraph of size \(\kappa\), iff every poset of size \(\kappa\) contains either a chain or an antichain of size \(\kappa\). The proof is by reducing the statement to an ordered set characterization due to \textit{W. Hanf} [``On a problem of Erdős and Tarski, Fundam. Math. 53, 325-334 (1964; Zbl 0276.02049)].

Recommendations

• scientific article; zbMATH DE number 4200229
• The Colouring Number
• Consistency results on infinite graphs
• A note on the Engelking-Karłowicz theorem
• Incompactness in regular cardinals

Cited in

(6)

• A necessary condition of the cardinal _
• Weakly compact cardinals in models of set theory
• scientific article; zbMATH DE number 1159535 (Why is no real title available?)
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• A Mitchell-like order for Ramsey and Ramsey-like cardinals
• A note on minor antichains of uncountable graphs

This page was built for publication:

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