盒形复合体:在图论和拓扑学的十字路口

IF 0.7 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-06-01 Epub Date: 2025-02-12 DOI:10.1016/j.disc.2025.114422
Hamid Reza Daneshpajouh , Frédéric Meunier
{"title":"盒形复合体:在图论和拓扑学的十字路口","authors":"Hamid Reza Daneshpajouh ,&nbsp;Frédéric Meunier","doi":"10.1016/j.disc.2025.114422","DOIUrl":null,"url":null,"abstract":"<div><div>Various simplicial complexes can be associated with a graph. Box complexes form an important family of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their topological properties. They provide thus a fascinating topic mixing topology and discrete mathematics. This paper is intended to provide an up-do-date survey on box complexes. It is based on classical results and recent findings from the literature, but also establishes new results improving our current understanding of the topic, and identifies several challenging open questions.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 6","pages":"Article 114422"},"PeriodicalIF":0.7000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Box complexes: At the crossroad of graph theory and topology\",\"authors\":\"Hamid Reza Daneshpajouh ,&nbsp;Frédéric Meunier\",\"doi\":\"10.1016/j.disc.2025.114422\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Various simplicial complexes can be associated with a graph. Box complexes form an important family of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their topological properties. They provide thus a fascinating topic mixing topology and discrete mathematics. This paper is intended to provide an up-do-date survey on box complexes. It is based on classical results and recent findings from the literature, but also establishes new results improving our current understanding of the topic, and identifies several challenging open questions.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 6\",\"pages\":\"Article 114422\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X25000305\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/2/12 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25000305","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/12 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

各种简单复合体可以与一个图相关联。箱形配合物是一类重要的简单配合物,通过它们的一些拓扑性质,在提供图的色数下界方面特别有用。因此,它们提供了一个迷人的主题,混合了拓扑和离散数学。本文旨在提供一个最新的调查箱形配合物。它基于经典结果和最近的文献发现,但也建立了新的结果,提高了我们目前对该主题的理解,并确定了几个具有挑战性的开放性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Box complexes: At the crossroad of graph theory and topology
Various simplicial complexes can be associated with a graph. Box complexes form an important family of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their topological properties. They provide thus a fascinating topic mixing topology and discrete mathematics. This paper is intended to provide an up-do-date survey on box complexes. It is based on classical results and recent findings from the literature, but also establishes new results improving our current understanding of the topic, and identifies several challenging open questions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Paradoxical behavior in Collatz sequences The defective parking space and defective Kreweras numbers The spectral moments of hypertrees and unicyclic hypergraphs Spectral radius and Hamiltonicity of uniform hypergraphs Generalized matching extension problem in regular bipartite graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1