On 3-chromatic hypergraphs
From MaRDI portal
Publication:1137600
DOI10.1016/0012-365X(78)90191-7zbMath0429.05055OpenAlexW1977676492WikidataQ56444801 ScholiaQ56444801MaRDI QIDQ1137600
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(78)90191-7
Related Items
Hypergraphs with high chromatic number, The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs, Probabilistic methods, From Erdős to algorithms, Cycles of length 0 modulo k in directed graphs, The Minimum Number of Edges in Uniform Hypergraphs with Property O, Conflict-Free Colourings of Uniform Hypergraphs With Few Edges, An algorithmic approach to the Lovász local lemma. I, Equitable colorings of non-uniform simple hypergraphs, Equitable colorings of nonuniform hypergraphs, On a problem of Erdős concerning property B, On the frequency of the most frequently occurring variable in dual monotone DNFs, Some properties of non-bicolorable hypergraphs and the four-color problem, A note on two-colorability of nonuniform hypergraphs, Lower bounds in the combinatorial problem of Erdős and Lovász, A General Framework for Hypergraph Coloring, On proper colorings of hypergraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, DP-colorings of hypergraphs, Some new bounds on partition critical hypergraphs, Coloring n-sets red and blue, Concepts on coloring of cluster hypergraphs with application, Extremal problems in hypergraph colourings, On positional games, Lower bounds for the number of edges in hypergraphs of certain classes, On property B(s). II, Equitable two-colorings of uniform hypergraphs, On \(r\)-chromatic hypergraphs, On the construction of non-2-colorable uniform hypergraphs, Colourings of Uniform Hypergraphs with Large Girth and Applications, On the chromatic number of set systems, On-line algorithms for 2-coloring hypergraphs via chip games, On balanced colorings of hypergraphs, Unnamed Item, Improved Bounds for Uniform Hypergraphs without Property B, Greedy colorings of uniform hypergraphs, Colorings of partial Steiner systems and their applications, Improvement of the lower bound in the Erdös-Hajnal combinatorial problem, Coloring non-uniform hypergraphs without short cycles, On the chromatic number of simple triangle-free triple systems, Matchings and covers in hypergraphs, On the chromatic number of finite systems of subsets, Random coloring method in the combinatorial problem of Erdős and Lovász, Note on alternating directed cycles, Sparse colour-critical hypergraphs, Around Erdős-Lovász problem on colorings of non-uniform hypergraphs, Probabilistic methods in coloring and decomposition problems
Cites Work
