The following pages link to (Q5724800):
Displayed 44 items.
- Unsplittable coverings in the plane (Q317324) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- Blocking sets of the classical unital (Q491986) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- Coupon coloring of some special graphs (Q512874) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Chip games and paintability (Q726662) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- Probabilistic methods (Q1091406) (← links)
- On 3-chromatic hypergraphs (Q1137600) (← links)
- On property B(s). II (Q1166541) (← links)
- On property B and on Steiner systems (Q1227623) (← links)
- An extremal problem in hypergraph coloring (Q1235714) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- Coupon-coloring and total domination in Hamiltonian planar triangulations (Q1756106) (← 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)
- On packing time-respecting arborescences (Q2172082) (← 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 coupon colorings of graphs (Q2354722) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- The \(B_r\) property and chromatic numbers of generalized graphs (Q2552143) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
- A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Edge (m,k)-choosability of graphs (Q5057728) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)