Coloring uniform hypergraphs with few edges
From MaRDI portal
Publication:3055779
DOI10.1002/rsa.20284zbMath1205.05092OpenAlexW4236390637WikidataQ85548126 ScholiaQ85548126MaRDI QIDQ3055779
Mohit Kumbhat, Alexandr V. Kostochka
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.20284
Related Items
Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, Extremal problems for colorings of simple hypergraphs and applications, Multipass greedy coloring of simple uniform hypergraphs, Lower bounds in the combinatorial problem of Erdős and Lovász, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, Colorings of \(b\)-simple hypergraphs, DP-colorings of hypergraphs, Improved algorithms for colorings of simple hypergraphs and applications, 2-colorings of hypergraphs with large girth, Extremal problems in hypergraph colourings, Lower bounds for the number of edges in hypergraphs of certain classes, Defective coloring of hypergraphs, Equitable two-colorings of uniform hypergraphs, On \(r\)-chromatic hypergraphs, Colourings of Uniform Hypergraphs with Large Girth and Applications, Constructions of sparse uniform hypergraphs with high chromatic number, Colorings of partial Steiner systems and their applications, Coloring hypergraphs with bounded cardinalities of edge intersections, Random coloring method in the combinatorial problem of Erdős and Lovász, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
Cites Work
