Pages that link to "Item:Q2349182"

The following pages link to On the construction of 3-chromatic hypergraphs with few edges (Q2349182):

Displayed 11 items.

• On the construction of non-2-colorable uniform hypergraphs (Q476325) ‎ (← links)
• Chip games and paintability (Q726662) ‎ (← links)
• Selective hypergraph colourings (Q906467) ‎ (← links)
• A note on panchromatic colorings (Q1690224) ‎ (← links)
• Chain method for panchromatic colorings of hypergraphs (Q2172391) ‎ (← links)
• \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713) ‎ (← links)
• A note on two-colorability of nonuniform hypergraphs (Q5002721) ‎ (← links)
• A General Framework for Hypergraph Coloring (Q5093586) ‎ (← links)
• Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) ‎ (← links)
• Extremal problems in hypergraph colourings (Q5112450) ‎ (← links)
• The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) ‎ (← links)