Coloring hypergraphs with bounded cardinalities of edge intersections

DOI10.1016/j.disc.2019.111692zbMath1433.05109arXiv1909.00448OpenAlexW2971674625MaRDI QIDQ2297713

Margarita Akhmejanova, Dmitriy A. Shabanov

Publication date: 20 February 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.00448

zbMATH Keywords

colorings of hypergraphsrandom recoloring method\(b\)-simple hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites Work

• Unnamed Item
• Improved algorithms for colorings of simple hypergraphs and applications
• A remark concerning arithmetic progressions
• A note on panchromatic colorings
• Equitable colorings of hypergraphs with \(r\) colors
• On the chromatic number of set systems
• Greedy colorings of uniform hypergraphs
• Coloring uniform hypergraphs with few edges
• Constructions of sparse uniform hypergraphs with high chromatic number
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Random coloring method in the combinatorial problem of Erdős and Lovász
• A note on random greedy coloring of uniform hypergraphs
• Multipass greedy coloring of simple uniform hypergraphs
• Colourings of Uniform Hypergraphs with Large Girth and Applications
• Improved bounds and algorithms for hypergraph 2-coloring
• Colorings of hypergraphs with large number of colors