Pages that link to "Item:Q1086588"
From MaRDI portal
The following pages link to Hypergraphs with high chromatic number (Q1086588):
Displaying 18 items.
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- On splittable colorings of graphs and hypergraphs (Q3150170) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
