Pages that link to "Item:Q4943351"
From MaRDI portal
The following pages link to Improved bounds and algorithms for hypergraph 2-coloring (Q4943351):
Displaying 20 items.
- On a generalization of Rubin's theorem (Q3018075) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← 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)
- The Minimum Number of Edges in Uniform Hypergraphs with Property O (Q3177361) (← links)
- A note on random greedy coloring of uniform hypergraphs (Q3452724) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
- On non-adaptive majority problems of large query size (Q5024678) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← 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)
- Improper Choosability and Property B (Q5325946) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
