Pages that link to "Item:Q2748418"
From MaRDI portal
The following pages link to On the chromatic number of set systems (Q2748418):
Displaying 24 items.
- Lower bounds in the combinatorial problem of Erdős and Lovász (Q606577) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Set systems with finite chromatic number (Q805616) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Transitive edge coloring of graphs and dimension of lattices (Q1410403) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- On cycle systems with specified weak chromatic number (Q1957974) (← links)
- On explicit constructions of designs (Q2121799) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Block avoiding point sequencings of partial Steiner systems (Q2673985) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927) (← links)
- (Q4298048) (← links)
- (Q4777296) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On chromatic number of graphs and set-systems (Q5530478) (← links)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)
