On a combinatorial principle of Hajnal and Komjáth

DOI10.2307/2273917MaRDI QIDQ3778744zbMATH OpenOpenAlexFDO

Authors Dan Velleman

Publication date 1986

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2273917

zbMATH Keywords

partition calculusset mappingssimplified morasses with linear limits

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• On the combinatorial principle P(c)
• A combinatorial proof of the Harer-Zagier formula
• A combinatorial proof of an infinite version of the Hales-Jewett theorem
• scientific article; zbMATH DE number 749930
• Combinatorics of Hankel relations
• scientific article; zbMATH DE number 464791
• scientific article; zbMATH DE number 4075095
• Combinatorial proofs of Honsberger-type identities
• A combinatorial analog of a theorem of F.J. Dyson
• Kleitman and combinatorics

Cited in

(5)

• Some higher-gap examples in combinatorial set theory
• Jensen's Σ* theory and the combinatorial content of V = L
• Morasses, square and forcing axioms
• On the Horton-Strahler Number for Combinatorial Tries
• A combinatorial proof of an infinite version of the Hales-Jewett theorem

This page was built for publication: On a combinatorial principle of Hajnal and Komjáth

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