Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Semi-Strong Colouring of Intersecting Hypergraphs

Semi-Strong Colouring of Intersecting Hypergraphs For any c ≥ 2, a c-strong colouring of the hypergraph G is an assignment of colours to the vertices of G such that, for every edge e of G, the vertices of e are coloured by at least min{c,|e|} distinct colours. The hypergraph G is t-intersecting if every two edges of G have at least t vertices in common.A natural variant of a question of Erdős and Lovász is: For fixed c ≥ 2 and t ≥ 1, what is the minimum number of colours that is sufficient to c-strong colour any t-intersecting hypergraphs? The purpose of this note is to describe some open problems related to this question. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png "Combinatorics,Probability and Computing" Cambridge University Press

Semi-Strong Colouring of Intersecting Hypergraphs

Loading next page...
 
/lp/cambridge-university-press/semi-strong-colouring-of-intersecting-hypergraphs-2HQxpCpPDS

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Cambridge University Press
Copyright
Copyright © Cambridge University Press 2013 
ISSN
1469-2163
eISSN
0963-5483
DOI
10.1017/S0963548313000515
Publisher site
See Article on Publisher Site

Abstract

For any c ≥ 2, a c-strong colouring of the hypergraph G is an assignment of colours to the vertices of G such that, for every edge e of G, the vertices of e are coloured by at least min{c,|e|} distinct colours. The hypergraph G is t-intersecting if every two edges of G have at least t vertices in common.A natural variant of a question of Erdős and Lovász is: For fixed c ≥ 2 and t ≥ 1, what is the minimum number of colours that is sufficient to c-strong colour any t-intersecting hypergraphs? The purpose of this note is to describe some open problems related to this question.

Journal

"Combinatorics,Probability and Computing"Cambridge University Press

Published: Oct 24, 2013

Keywords: Primary 05C15; Secondary 05D40

There are no references for this article.