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