Coloring non-uniform hypergraphs without short cycles

DOI10.1007/S00373-013-1333-9MaRDI QIDQ742641zbMATH OpenOpenAlexFDO

Authors D. A. Shabanov

Publication date 19 September 2014

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-013-1333-9

zbMATH Keywords

chromatic numbernon-uniform hypergraphshypergraphs with large girthErdős-Lovász problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• On colorings of non-uniform hypergraphs without short cycles
• On coloring uniform hypergraphs without 3-cycles
• Random coloring method in the combinatorial problem of Erdős and Lovász
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number

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?)
• Color-critical graphs and hypergraphs with few edges: a survey
• Coloring n-sets red and blue
• Coloring uniform hypergraphs with few colors
• Greedy colorings of uniform hypergraphs
• Hypergraphs with high chromatic number
• Improved bounds and algorithms for hypergraph 2-coloring
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• On 3-chromatic hypergraphs
• On \(r\)-chromatic hypergraphs
• On a combinatorial problem of P. Erdős and L. Lovasz
• On a combinatorial problem. II
• On a property of families of sets
• On the chromatic number of finite systems of subsets

Cited in

(15)

• Greedy colorings of uniform hypergraphs
• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• 2-colorings of hypergraphs with large girth
• scientific article; zbMATH DE number 3884214 (Why is no real title available?)
• Extremal problems in hypergraph colourings
• On coloring uniform hypergraphs without 3-cycles
• Equitable colorings of non-uniform simple hypergraphs
• Equitable colorings of nonuniform hypergraphs
• Uncountable dichromatic number without short directed cycles
• A hypergraph-free construction of highly chromatic graphs without short cycles
• On Ramsey families of sets
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• Coloring uniform hypergraphs with few edges

This page was built for publication: Coloring non-uniform hypergraphs without short cycles

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