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