On the faces of unigraphic 3-polytopes

IF 1 3区 数学 Q1 MATHEMATICS European Journal of Combinatorics Pub Date : 2024-10-16 DOI:10.1016/j.ejc.2024.104081
Riccardo W. Maffucci
{"title":"On the faces of unigraphic 3-polytopes","authors":"Riccardo W. Maffucci","doi":"10.1016/j.ejc.2024.104081","DOIUrl":null,"url":null,"abstract":"<div><div>A 3-polytope is a 3-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other 3-polytope, up to graph isomorphism. The classification of unigraphic 3-polytopes appears to be a difficult problem.</div><div>In this paper we prove that, apart from pyramids, all unigraphic 3-polytopes have no <span><math><mi>n</mi></math></span>-gonal faces for <span><math><mrow><mi>n</mi><mo>≥</mo><mn>10</mn></mrow></math></span>. Our method involves defining several planar graph transformations on a given 3-polytope containing an <span><math><mi>n</mi></math></span>-gonal face with <span><math><mrow><mi>n</mi><mo>≥</mo><mn>10</mn></mrow></math></span>. The delicate part is to prove that, for every such 3-polytope, at least one of these transformations both preserves 3-connectivity, and is not an isomorphism.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001665","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A 3-polytope is a 3-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other 3-polytope, up to graph isomorphism. The classification of unigraphic 3-polytopes appears to be a difficult problem.
In this paper we prove that, apart from pyramids, all unigraphic 3-polytopes have no n-gonal faces for n10. Our method involves defining several planar graph transformations on a given 3-polytope containing an n-gonal face with n10. The delicate part is to prove that, for every such 3-polytope, at least one of these transformations both preserves 3-connectivity, and is not an isomorphism.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于单图式 3 多面体的面
3 多面体是一个 3 连接的平面图形。如果它的顶点度序列不与任何其他 3 多面体共享,直到图同构,那么它就被称为单图形。在本文中,我们证明了除金字塔外,所有单图形三多面体在 n≥10 时都没有 n 个球面。我们的方法是在一个给定的 3 多面体上定义几个平面图形变换,其中包含一个 n≥10 的 n 角面。最复杂的部分是证明,对于每一个这样的 3 多面体,这些变换中至少有一个既保留了 3 连通性,又不是同构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
期刊最新文献
A combinatorial PROP for bialgebras Signed Mahonian polynomials on derangements in classical Weyl groups Degree conditions for Ramsey goodness of paths Bounded unique representation bases for the integers On the faces of unigraphic 3-polytopes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1