Publication:5477816
From MaRDI portal
zbMath1094.05025MaRDI QIDQ5477816
Publication date: 29 June 2006
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Point partition numbers: decomposable and indecomposable critical graphs, Equitable colorings of nonuniform hypergraphs, Multipass greedy coloring of simple uniform hypergraphs, On the minimum number of edges in triangle-free 5-critical graphs, The minimum number of edges in 4-critical digraphs of given order, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, A note on panchromatic colorings, DP-colorings of hypergraphs, 2-colorings of hypergraphs with large girth, Extremal problems in hypergraph colourings, Upper bound in the Erdős-Hajnal problem of hypergraph coloring, Combinatorial extremum problems for 2-colorings of hypergraphs, On colorings of 3-homogeneous hypergraphs in 3 colors, Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph, On \(r\)-chromatic hypergraphs, 2-colorings of uniform hypergraphs, Critically paintable, choosable or colorable graphs, Coloring non-uniform hypergraphs without short cycles, Equitable colorings of hypergraphs with few edges, On the chromatic number of finite systems of subsets, On the Problem of Erdős and Hajnal in the Case of List Colorings, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
