Semi-Strong Colouring of Intersecting Hypergraphs
From MaRDI portal
Publication:5414142
DOI10.1017/S0963548313000515zbMath1292.05198arXiv1203.2868MaRDI QIDQ5414142
Amit Weinstein, Yuichi Yoshida, Eric Blais
Publication date: 2 May 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2868
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (max. 100)
On \(r\)-dynamic coloring of graphs ⋮ On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
Cites Work
This page was built for publication: Semi-Strong Colouring of Intersecting Hypergraphs