On a property of families of sets

DOI10.1007/BF02066676zbMath0201.32801WikidataQ56444803 ScholiaQ56444803MaRDI QIDQ5599149

Paul Erdős, Andras Hajnal

Publication date: 1961

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

Mathematics Subject Classification ID

05D05: Extremal set theory

03E05: Other combinatorial set theory

Related Items

On chromatic number of graphs and set-systems, Partition relations for cardinal numbers, On a combinatorial problem. II, Transversals of squares, Intersection properties of functions on cardinals, Intersection properties of functions on cardinals, An anti-Hausdorff Fréchet space in which convergent sequences have unique limits, Families close to disjoint ones, Set systems with finite chromatic number, Hypergraphs with high chromatic number, The enumeration problem for color critical linear hypergraphs, Families of sets having property B, On-line algorithms for 2-coloring hypergraphs via chip games, The transversal property implies property B, An extremal problem in hypergraph coloring, On a combinatorial problem of P. Erdős and L. Lovasz, Some generalizations of property \(B\) and the splitting property, Matchings and covers in hypergraphs, Bipartite bihypergraphs: a survey and new results, The \(B_r\) property and chromatic numbers of generalized graphs, Separability properties of almost-disjoint families of sets, Some remarks on simple tournaments, Transversals for strongly almost disjoint families, A note on almost disjoint families, The existence problem for colour critical linear hypergraphs, Splitting Strongly Almost Disjoint Families

Cites Work

• On families of mutually exclusive sets
• On the structure of set-mappings
• Some results and problems on set theory
• The Marriage Problem
• Unnamed Item