On 3-chromatic hypergraphs

DOI10.1016/0012-365X(78)90191-7MaRDI QIDQ1137600zbMATH OpenOpenAlexWikidataFDO

Authors József Beck

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

zbMATH Keywords

3-chromatic hypergraphuniform hypergraph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• On a combinatorial problem of P. Erdős and L. Lovasz
• On a combinatorial problem. II

Cited in

(48)

• On the chromatic number of finite systems of subsets
• Hypergraphs with high chromatic number
• Probabilistic methods
• Cycles of length 0 modulo k in directed graphs
• On a problem of Erdős concerning property B
• Coloring n-sets red and blue
• On positional games
• On property B(s). II
• On-line algorithms for 2-coloring hypergraphs via chip games
• Probabilistic methods in coloring and decomposition problems
• From Erdős to algorithms
• On the frequency of the most frequently occurring variable in dual monotone DNFs
• Note on alternating directed cycles
• Matchings and covers in hypergraphs
• Some properties of non-bicolorable hypergraphs and the four-color problem
• On proper colorings of hypergraphs
• Concepts on coloring of cluster hypergraphs with application
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• DP-colorings of hypergraphs
• Colorings of partial Steiner systems and their applications
• On the chromatic number of set systems
• On colorings of non-uniform hypergraphs without short cycles
• Conflict-free colourings of uniform hypergraphs with few edges
• Greedy colorings of uniform hypergraphs
• Random coloring method in the combinatorial problem of Erdős and Lovász
• The minimum number of edges in uniform hypergraphs with property O
• Equitable colorings of non-uniform simple hypergraphs
• Equitable colorings of nonuniform hypergraphs
• An algorithmic approach to the Lovász local lemma. I
• Some new bounds on partition critical hypergraphs
• Equitable two-colorings of uniform hypergraphs
• Colourings of uniform hypergraphs with large girth and applications
• On the construction of non-2-colorable uniform hypergraphs
• A note on two-colorability of nonuniform hypergraphs
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
• A general framework for hypergraph coloring
• Improved Bounds for Uniform Hypergraphs without Property B
• Extremal problems in hypergraph colourings
• On balanced colorings of hypergraphs
• The intersection spectrum of 3‐chromatic intersecting 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
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• Improving Gebauer's construction of 3-chromatic hypergraphs with few edges
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• Coloring non-uniform hypergraphs without short cycles
• Sparse colour-critical hypergraphs

This page was built for publication: On 3-chromatic hypergraphs

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