Coloring Properties of Categorical Product of General Kneser Hypergraphs
| Title: | Coloring Properties of Categorical Product of General Kneser Hypergraphs |
|---|---|
| Authors: | Sani, Roya Abyazi, Alishahi, Meysam, Taherkhani, Ali |
| Publication Year: | 2017 |
| Collection: | Mathematics |
| Subject Terms: | Mathematics - Combinatorics |
| More Details: | More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has received a considerable attention in recent years. Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992. Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound for the chromatic number of categorical product of general Kneser hypergraphs and using this lower bound, they verified Zhu's conjecture for some families of hypergraphs. In this paper, we shall present some colorful type results for the coloring of categorical product of general Kneser hypergraphs, which generalize the Hajiabolhassan-Meunier result. Also, we present a new lower bound for the chromatic number of categorical product of general Kneser hypergraphs which can be extremely better than the Hajiabolhassan-Meunier lower bound. Using this lower bound, we enrich the family of hypergraphs satisfying Zhu's conjecture. |
| Document Type: | Working Paper |
| Access URL: | http://arxiv.org/abs/1705.00223 |
| Accession Number: | edsarx.1705.00223 |
| Database: | arXiv |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://arxiv.org/abs/1705.00223 Name: EDS - Arxiv Category: fullText Text: View this record from Arxiv MouseOverText: View this record from Arxiv – Url: https://resolver.ebsco.com/c/xy5jbn/result?sid=EBSCO:edsarx&genre=article&issn=&ISBN=&volume=&issue=&date=20170429&spage=&pages=&title=Coloring Properties of Categorical Product of General Kneser Hypergraphs&atitle=Coloring%20Properties%20of%20Categorical%20Product%20of%20General%20Kneser%20Hypergraphs&aulast=Sani%2C%20Roya%20Abyazi&id=DOI: Name: Full Text Finder (for New FTF UI) (s8985755) Category: fullText Text: Find It @ SCU Libraries MouseOverText: Find It @ SCU Libraries |
|---|---|
| Header | DbId: edsarx DbLabel: arXiv An: edsarx.1705.00223 RelevancyScore: 961 AccessLevel: 3 PubType: Report PubTypeId: report PreciseRelevancyScore: 961.150268554688 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Coloring Properties of Categorical Product of General Kneser Hypergraphs – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Sani%2C+Roya+Abyazi%22">Sani, Roya Abyazi</searchLink><br /><searchLink fieldCode="AR" term="%22Alishahi%2C+Meysam%22">Alishahi, Meysam</searchLink><br /><searchLink fieldCode="AR" term="%22Taherkhani%2C+Ali%22">Taherkhani, Ali</searchLink> – Name: DatePubCY Label: Publication Year Group: Date Data: 2017 – Name: Subset Label: Collection Group: HoldingsInfo Data: Mathematics – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Mathematics+-+Combinatorics%22">Mathematics - Combinatorics</searchLink> – Name: Abstract Label: Description Group: Ab Data: More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has received a considerable attention in recent years. Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992. Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound for the chromatic number of categorical product of general Kneser hypergraphs and using this lower bound, they verified Zhu's conjecture for some families of hypergraphs. In this paper, we shall present some colorful type results for the coloring of categorical product of general Kneser hypergraphs, which generalize the Hajiabolhassan-Meunier result. Also, we present a new lower bound for the chromatic number of categorical product of general Kneser hypergraphs which can be extremely better than the Hajiabolhassan-Meunier lower bound. Using this lower bound, we enrich the family of hypergraphs satisfying Zhu's conjecture. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Working Paper – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://arxiv.org/abs/1705.00223" linkWindow="_blank">http://arxiv.org/abs/1705.00223</link> – Name: AN Label: Accession Number Group: ID Data: edsarx.1705.00223 |
| PLink | https://login.libproxy.scu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1705.00223 |
| RecordInfo | BibRecord: BibEntity: Subjects: – SubjectFull: Mathematics - Combinatorics Type: general Titles: – TitleFull: Coloring Properties of Categorical Product of General Kneser Hypergraphs Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Sani, Roya Abyazi – PersonEntity: Name: NameFull: Alishahi, Meysam – PersonEntity: Name: NameFull: Taherkhani, Ali IsPartOfRelationships: – BibEntity: Dates: – D: 29 M: 04 Type: published Y: 2017 |
| ResultId | 1 |