Greedy colorings of uniform hypergraphs

DOI10.1002/RSA.20267MaRDI QIDQ3055773zbMATH OpenOpenAlexFDO

Authors András Pluhár

Publication date 9 November 2010

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20267

zbMATH Keywords

coloring hypergraphgreedy algorithmregular

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• A note on random greedy coloring of uniform hypergraphs
• A note on two-colorability of nonuniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• Coloring non-uniform hypergraphs without short cycles
• On the chromatic index of random uniform hypergraphs

Cites work

• Coloring n-sets red and blue
• Coloring uniform hypergraphs with few colors
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• Every 8-uniform 8-regular hypergraph is 2-colorable
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• The Even Cycle Problem for Directed Graphs

Cited in

(28)

• Colorings of b-simple hypergraphs
• A note on panchromatic colorings
• On proper colorings of hypergraphs
• On the Erdős-Hajnal problem for 3-graphs
• Chain method for panchromatic colorings of hypergraphs
• Coloring hypergraphs with bounded cardinalities of edge intersections
• Equitable colorings of hypergraphs with few edges
• Combinatorial extremum problems for 2-colorings of hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• On the problem of Erdős and Hajnal in the case of list colorings
• Regular behavior of the maximal hypergraph chromatic number
• A note on random greedy coloring of uniform hypergraphs
• Multipass greedy coloring of simple uniform hypergraphs
• scientific article; zbMATH DE number 3906523 (Why is no real title available?)
• Colourings of uniform hypergraphs with large girth and applications
• Approximate coloring of uniform hypergraphs
• A quantitative Lovász criterion for Property B
• A note on two-colorability of nonuniform hypergraphs
• A general framework for hypergraph coloring
• Extremal problems in hypergraph colourings
• List colorings of multipartite hypergraphs
• Colorings of hypergraphs with large number of colors
• Colorings of hypergraphs with large number of colors
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Erdős-Hajnal problem for \(H\)-free hypergraphs
• Trees in greedy colorings of hypergraphs
• On r-chromatic hypergraphs
• Coloring non-uniform hypergraphs without short cycles

This page was built for publication: Greedy colorings of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055773)