On a property of families of sets
From MaRDI portal
Publication:5599149
DOI10.1007/BF02066676zbMath0201.32801OpenAlexW1989403727WikidataQ56444803 ScholiaQ56444803MaRDI QIDQ5599149
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
Related Items (68)
Hypergraphs with high chromatic number ⋮ On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ On general two-colorings of uniform hypergraphs ⋮ Equitable colorings of nonuniform hypergraphs ⋮ On the arithmetic of density ⋮ Multipass greedy coloring of simple uniform hypergraphs ⋮ On a combinatorial problem. II ⋮ Improper Choosability and Property B ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ A note on two-colorability of nonuniform hypergraphs ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ DP-colorings of hypergraphs ⋮ The enumeration problem for color critical linear hypergraphs ⋮ Transversals of squares ⋮ Minimal vertex covers in infinite hypergraphs ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ Conflict free colorings of (strongly) almost disjoint set-systems ⋮ Upper bound in the Erdős-Hajnal problem of hypergraph coloring ⋮ On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ Families of sets having property B ⋮ Combinatorial extremum problems for 2-colorings of hypergraphs ⋮ On colorings of 3-homogeneous hypergraphs in 3 colors ⋮ On the Erdős-Hajnal problem for 3-uniform hypergraphs ⋮ Colorings of hypergraphs with large number of colors ⋮ Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph ⋮ Colorings of hypergraphs with large number of colors ⋮ Essentially disjoint families, conflict free colorings and Shelah's revised GCH ⋮ On two-colorings of hypergraphs ⋮ On \(r\)-chromatic hypergraphs ⋮ Splitting families of sets in ZFC ⋮ 2-colorings of uniform hypergraphs ⋮ On a generalization of Rubin's theorem ⋮ An anti-Hausdorff Fréchet space in which convergent sequences have unique limits ⋮ Minimal covering sets for infinite set systems ⋮ On-line algorithms for 2-coloring hypergraphs via chip games ⋮ On balanced colorings of hypergraphs ⋮ The transversal property implies property B ⋮ Bipartite bihypergraphs: a survey and new results ⋮ The existence problem for colour critical linear hypergraphs ⋮ A note on almost disjoint families ⋮ An extremal problem in hypergraph coloring ⋮ Splitting Strongly Almost Disjoint Families ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ On a combinatorial problem of P. Erdős and L. Lovasz ⋮ Chip games and paintability ⋮ Improvement of the lower bound in the Erdös-Hajnal combinatorial problem ⋮ On equitable colorings of hypergraphs ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ Intersection properties of functions on cardinals ⋮ Matchings and covers in hypergraphs ⋮ Intersection properties of functions on cardinals ⋮ The \(B_r\) property and chromatic numbers of generalized graphs ⋮ On the chromatic number of finite systems of subsets ⋮ Separability properties of almost-disjoint families of sets ⋮ Some remarks on simple tournaments ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász ⋮ On the Problem of Erdős and Hajnal in the Case of List Colorings ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) ⋮ Families close to disjoint ones ⋮ Some generalizations of property \(B\) and the splitting property ⋮ Transversals for strongly almost disjoint families ⋮ Set systems with finite chromatic number ⋮ On chromatic number of graphs and set-systems ⋮ Partition relations for cardinal numbers
Cites Work
This page was built for publication: On a property of families of sets
