Hypergraph coverings and local colorings

DOI10.1016/0095-8956(91)90092-XzbMath0675.05050OpenAlexW2060698513MaRDI QIDQ1121913

Yair Caro, Zsolt Tuza

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90092-x

zbMATH Keywords

chromatic numberuniform hypergraphsedge coveringweighted coveringlocal coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Homotopy and Hom construction in the category of finite hypergraphs ⋮ Bounded degrees and prescribed distances in graphs ⋮ Bounding the feedback vertex number of digraphs in terms of vertex degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Linear upper bounds for local Ramsey numbers
• Inequalities for two set systems with prescribed intersections
• Local \(k\)-colorings of graphs and hypergraphs
• On a problem of G. O. H. Katona and T. Tarján

This page was built for publication: Hypergraph coverings and local colorings