On the complete subgraphs of graphs defined by systems of sets

DOI10.1007/BF02020452zbMath0151.33702OpenAlexW2137707171MaRDI QIDQ5530479

Eric C. Milner, Andras Hajnal

Publication date: 1966

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02020452

zbMATH Keywords

topology

Related Items (10)

Ramsey theory over partitions III: Strongly Luzin sets and partition relations ⋮ A problem on well ordered sets ⋮ Partitioning pairs of countable ordinals ⋮ A Lindelöf group with non-Lindelöf square ⋮ Conflict free colorings of (strongly) almost disjoint set-systems ⋮ Families of sets having property B ⋮ Transforming rectangles into squares, with applications to strong colorings ⋮ Essentially disjoint families, conflict free colorings and Shelah's revised GCH ⋮ Was Ulam right? I: basic theory and subnormal ideals ⋮ Graphs defined by coverings of a set

Cites Work

• Teilmengen von Mengen mit Relationen
• A partition calculus in set theory
• On a theorem in the theory of relations and a solution of a problem of Knaster
• The Pigeon-Hole Principle for Ordinal Numbers
• Partition relations for cardinal numbers

This page was built for publication: On the complete subgraphs of graphs defined by systems of sets