Coloring uniform hypergraphs with few edges

DOI10.1002/RSA.20284zbMATH Open1205.05092DBLPjournals/rsa/KostochkaK09OpenAlexW4236390637WikidataQ85548126 ScholiaQ85548126MaRDI QIDQ3055779FDOQ3055779

Authors: M. Kumbhat, Alexandr Kostochka 

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.20284

Recommendations

• Colorings of \(b\)-simple hypergraphs
• On \(r\)-chromatic hypergraphs
• Coloring non-uniform hypergraphs without short cycles
• Coloring uniform hypergraphs with few colors
• Coloring hypergraphs with bounded cardinalities of edge intersections

zbMATH Keywords

maximum degreehypergraph coloringedge-degreesmall size

Mathematics Subject Classification ID

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

Cites Work

• A remark concerning arithmetic progressions

Cited In (26)

• Coloring hypergraphs with bounded cardinalities of edge intersections
• Random coloring method in the combinatorial problem of Erdős and Lovász
• Approximate coloring of uniform hypergraphs
• Hypergraph list coloring and Euclidean Ramsey theory
• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• Multipass greedy coloring of simple uniform hypergraphs
• Colourings of uniform hypergraphs with large girth and applications
• Colorings of \(b\)-simple hypergraphs
• Lower bounds for the number of edges in hypergraphs of certain classes
• DP-colorings of hypergraphs
• 2-colorings of hypergraphs with large girth
• Extremal problems in hypergraph colourings
• Colorings of partial Steiner systems and their applications
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Extremal problems for colorings of simple hypergraphs and applications
• On \(r\)-chromatic hypergraphs
• Equitable two-colorings of uniform hypergraphs
• Lower bounds in the combinatorial problem of Erdős and Lovász
• Defective coloring of hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Title not available (Why is that?)
• Constructions of sparse uniform hypergraphs with high chromatic number
• Coloring hypergraphs of low connectivity
• Improved algorithms for colorings of simple hypergraphs and applications
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

This page was built for publication: Coloring uniform hypergraphs with few edges

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