The following pages link to On a combinatorial problem. II (Q5599180):
Displayed 50 items.
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← 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)
- 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)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On general two-colorings of uniform hypergraphs (Q845499) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Probabilistic methods (Q1091406) (← links)
- On 3-chromatic hypergraphs (Q1137600) (← links)
- On property B(s). II (Q1166541) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- On property B and on Steiner systems (Q1227623) (← links)
- An extremal problem in hypergraph coloring (Q1235714) (← links)
- Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
- On a combinatorial problem of P. Erdős and L. Lovasz (Q1241757) (← links)
- The choice number of random bipartite graphs (Q1293418) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Extremal problems among subsets of a set (Q1843567) (← links)
- Puncture sets (Q1846873) (← links)
- On proper colorings of hypergraphs (Q1930218) (← 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)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← 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)
- Equitable colorings of hypergraphs with \(r\) colors (Q2671950) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)