The following pages link to On a property of families of sets (Q5599149):
Displaying 50 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- On the arithmetic of density (Q330057) (← links)
- Splitting families of sets in ZFC (Q475276) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- On balanced colorings of hypergraphs (Q548768) (← links)
- Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph (Q650517) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- An anti-Hausdorff Fréchet space in which convergent sequences have unique limits (Q689602) (← links)
- Chip games and paintability (Q726662) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Families close to disjoint ones (Q794639) (← links)
- Set systems with finite chromatic number (Q805616) (← links)
- On general two-colorings of uniform hypergraphs (Q845499) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- Families of sets having property B (Q1156131) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- The transversal property implies property B (Q1219280) (← links)
- An extremal problem in hypergraph coloring (Q1235714) (← links)
- On a combinatorial problem of P. Erdős and L. Lovasz (Q1241757) (← links)
- Some generalizations of property \(B\) and the splitting property (Q1306741) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Conflict free colorings of (strongly) almost disjoint set-systems (Q1945294) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- Minimal covering sets for infinite set systems (Q1999754) (← links)
- On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- In memoriam: James Earl Baumgartner (1943--2011) (Q2408079) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805) (← links)
- On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
- Essentially disjoint families, conflict free colorings and Shelah's revised GCH (Q2448972) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- The \(B_r\) property and chromatic numbers of generalized graphs (Q2552143) (← links)
- Separability properties of almost-disjoint families of sets (Q2555499) (← links)
- Some remarks on simple tournaments (Q2562867) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Minimal vertex covers in infinite hypergraphs (Q2685313) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- On a generalization of Rubin's theorem (Q3018075) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← links)
