The following pages link to Coloring H-free hypergraphs (Q3055875):
Displaying 14 items.
- The independent neighborhoods process (Q312273) (← links)
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- List coloring triangle-free hypergraphs (Q3452728) (← links)
- Trees and $n$-Good Hypergraphs (Q4622621) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Bounds on Ramsey games via alterations (Q6081572) (← links)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
