Title of article :
Sunflower hypergraphs are chromatically unique Original Research Article
Author/Authors :
Ioan Tomescu، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Pages :
3
From page :
355
To page :
357
Abstract :
In a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that any two edges overlap in a fixed (h−1)-subset of vertices are chromatically unique, but a step in their proof was faulty. In this note a valid proof for this step is proposed.
Keywords :
Chromatic polynomial , Chromatically unique hypergraph
Journal title :
Discrete Mathematics
Serial Year :
2004
Journal title :
Discrete Mathematics
Record number :
949009
Link To Document :
بازگشت