Greedy colorings of uniform hypergraphs
From MaRDI portal
Publication:3055773
DOI10.1002/rsa.20267zbMath1209.05097OpenAlexW4254640110MaRDI QIDQ3055773
Publication date: 9 November 2010
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20267
Related Items
A note on random greedy coloring of uniform hypergraphs ⋮ Multipass greedy coloring of simple uniform hypergraphs ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ A General Framework for Hypergraph Coloring ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ On proper colorings of hypergraphs ⋮ Trees in greedy colorings of hypergraphs ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Colorings of \(b\)-simple hypergraphs ⋮ A note on panchromatic colorings ⋮ Erdős-Hajnal problem for \(H\)-free hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Combinatorial extremum problems for 2-colorings of hypergraphs ⋮ Colorings of hypergraphs with large number of colors ⋮ Colorings of hypergraphs with large number of colors ⋮ On \(r\)-chromatic hypergraphs ⋮ Regular Behavior of the Maximal Hypergraph Chromatic Number ⋮ Colourings of Uniform Hypergraphs with Large Girth and Applications ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ List colorings of multipartite hypergraphs ⋮ Equitable colorings of hypergraphs with few edges ⋮ A quantitative Lovász criterion for Property B ⋮ On the Problem of Erdős and Hajnal in the Case of List Colorings
Cites Work
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- Every 8-uniform 8-regular hypergraph is 2-colorable
- The Even Cycle Problem for Directed Graphs
- Coloring uniform hypergraphs with few colors
- Improved bounds and algorithms for hypergraph 2-coloring
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
