Pages that link to "Item:Q3055773"
From MaRDI portal
The following pages link to Greedy colorings of uniform hypergraphs (Q3055773):
Displayed 25 items.
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← 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 quantitative Lovász criterion for Property B (Q4993116) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← 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)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)