On a property of families of sets

DOI10.1007/BF02066676zbMATH Open0201.32801OpenAlexW1989403727WikidataQ56444803 ScholiaQ56444803MaRDI QIDQ5599149FDOQ5599149

Authors: Andras Hajnal, P. Erdős 

Publication date: 1961

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

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

Recommendations

• On a problem of Erdős concerning property B
• Publication:3035284
• scientific article; zbMATH DE number 2188343
• On A Combinatorial Problem III
• On a combinatorial problem. II

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Extremal set theory (05D05)

Cites Work

• On the structure of set-mappings
• On families of mutually exclusive sets
• The Marriage Problem
• Some results and problems on set theory
• Title not available (Why is that?)

Cited In (90)

• A new construction for cancellative families of sets
• Random coloring method in the combinatorial problem of Erdős and Lovász
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• Improper choosability and property B
• On colorings of 3-homogeneous hypergraphs in 3 colors
• On topological properties of families of finite sets
• Title not available (Why is that?)
• Bipartite bihypergraphs: a survey and new results
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• Multipass greedy coloring of simple uniform hypergraphs
• A note on equal unions in families of sets
• On general two-colorings of uniform hypergraphs
• An anti-Hausdorff Fréchet space in which convergent sequences have unique limits
• On a problem of Erdős concerning property B
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some remarks on simple tournaments
• The \(B_r\) property and chromatic numbers of generalized graphs
• 2-colorings of hypergraphs with large girth
• On algorithmic methods of analysis of two-colorings of hypergraphs
• Splitting Strongly Almost Disjoint Families
• Title not available (Why is that?)
• Chip games and paintability
• Title not available (Why is that?)
• On the unique representation of families of sets
• On balanced colorings of hypergraphs
• On proper colourings of hypergraphs using prescribed colours
• Title not available (Why is that?)
• On-line algorithms for 2-coloring hypergraphs via chip games
• Hypergraphs with high chromatic number
• Transversals for strongly almost disjoint families
• Some generalizations of property \(B\) and the splitting property
• In memoriam: James Earl Baumgartner (1943--2011)
• On chromatic number of graphs and set-systems
• Separability properties of almost-disjoint families of sets
• Families of sets having property B
• Equitable colorings of nonuniform hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(r\)-chromatic hypergraphs
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• Title not available (Why is that?)
• On a combinatorial problem. II
• On the arithmetic of density
• On a combinatorial problem of P. Erdős and L. Lovasz
• Matchings and covers in hypergraphs
• Coloring non-uniform hypergraphs without short cycles
• Splitting families of sets in ZFC
• Common supports of families of sets
• Title not available (Why is that?)
• Families close to disjoint ones
• On the problem of Erdős and Hajnal in the case of list colorings
• On the chromatic number of finite systems of subsets
• On equitable colorings of hypergraphs
• Property S
• Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph
• On two-colorings of hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• The existence problem for colour critical linear hypergraphs
• 2-colorings of uniform hypergraphs
• Set systems with finite chromatic number
• Conflict free colorings of (strongly) almost disjoint set-systems
• On the Erdős-Hajnal problem for 3-graphs
• The enumeration problem for color critical linear hypergraphs
• Colorings of hypergraphs with large number of colors
• Colorings of hypergraphs with large number of colors
• An extremal problem in hypergraph coloring
• The transversal property implies property B
• A note on two-colorability of nonuniform hypergraphs
• Partition relations for cardinal numbers
• Combinatorial extremum problems for 2-colorings of hypergraphs
• A note on almost disjoint families
• On a generalization of Rubin's theorem
• Minimal covering sets for infinite set systems
• Intersection properties of functions on cardinals
• Intersection properties of functions on cardinals
• Transversals of squares
• Title not available (Why is that?)
• DP-colorings of hypergraphs
• Extremal problems in hypergraph colourings
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• Title not available (Why is that?)
• Chain method for panchromatic colorings of hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Title not available (Why is that?)
• Minimal vertex covers in infinite hypergraphs
• Title not available (Why is that?)
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

This page was built for publication: On a property of families of sets

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