Hedetniemi猜想与无穷布尔格的反例

IF 0.2 Q4 MATHEMATICS

Commentationes Mathematicae Universitatis Carolinae Pub Date : 2023-02-13 DOI:10.14712/1213-7243.2023.003

Claude Tardif

{"title":"Hedetniemi猜想与无穷布尔格的反例","authors":"Claude Tardif","doi":"10.14712/1213-7243.2023.003","DOIUrl":null,"url":null,"abstract":"We prove that for any c ≥ 5, there exists an infinite family (Gn)n∈N of graphs such that χ(Gn) > c for all n ∈ N and χ(Gm×Gn) ≤ c for all m 6= n. These counterexamples to Hedetniemi’s conjecture show that the Boolean lattices of exponential graphs with Kc as a base are infinite for c ≥ 5.","PeriodicalId":44396,"journal":{"name":"Commentationes Mathematicae Universitatis Carolinae","volume":" ","pages":""},"PeriodicalIF":0.2000,"publicationDate":"2023-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices\",\"authors\":\"Claude Tardif\",\"doi\":\"10.14712/1213-7243.2023.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that for any c ≥ 5, there exists an infinite family (Gn)n∈N of graphs such that χ(Gn) > c for all n ∈ N and χ(Gm×Gn) ≤ c for all m 6= n. These counterexamples to Hedetniemi’s conjecture show that the Boolean lattices of exponential graphs with Kc as a base are infinite for c ≥ 5.\",\"PeriodicalId\":44396,\"journal\":{\"name\":\"Commentationes Mathematicae Universitatis Carolinae\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2023-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Commentationes Mathematicae Universitatis Carolinae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14712/1213-7243.2023.003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Commentationes Mathematicae Universitatis Carolinae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14712/1213-7243.2023.003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

我们证明了对于任意c≥5，存在一个图的无限族（Gn）n∈n，使得所有n∈n的χ（Gn。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

We prove that for any c ≥ 5, there exists an infinite family (Gn)n∈N of graphs such that χ(Gn) > c for all n ∈ N and χ(Gm×Gn) ≤ c for all m 6= n. These counterexamples to Hedetniemi’s conjecture show that the Boolean lattices of exponential graphs with Kc as a base are infinite for c ≥ 5.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Commentationes Mathematicae Universitatis Carolinae MATHEMATICS-

CiteScore

0.60

自引率

0.00%

发文量