定向射线的普遍性

Pub Date : 2024-05-12 DOI:10.1002/jgt.23114
Florian Gut, Thilo Krill, Florian Reich
{"title":"定向射线的普遍性","authors":"Florian Gut,&nbsp;Thilo Krill,&nbsp;Florian Reich","doi":"10.1002/jgt.23114","DOIUrl":null,"url":null,"abstract":"<p>A digraph <span></span><math>\n <semantics>\n <mrow>\n <mi>H</mi>\n </mrow>\n <annotation> $H$</annotation>\n </semantics></math> is called <i>ubiquitous</i> if every digraph <span></span><math>\n <semantics>\n <mrow>\n <mi>D</mi>\n </mrow>\n <annotation> $D$</annotation>\n </semantics></math> that contains <span></span><math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math> vertex-disjoint copies of <span></span><math>\n <semantics>\n <mrow>\n <mi>H</mi>\n </mrow>\n <annotation> $H$</annotation>\n </semantics></math> for every <span></span><math>\n <semantics>\n <mrow>\n <mi>k</mi>\n <mo>∈</mo>\n <mi>N</mi>\n </mrow>\n <annotation> $k\\in {\\mathbb{N}}$</annotation>\n </semantics></math> also contains infinitely many vertex-disjoint copies of <span></span><math>\n <semantics>\n <mrow>\n <mi>H</mi>\n </mrow>\n <annotation> $H$</annotation>\n </semantics></math>. We characterise which digraphs with rays as underlying undirected graphs are ubiquitous.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23114","citationCount":"0","resultStr":"{\"title\":\"Ubiquity of oriented rays\",\"authors\":\"Florian Gut,&nbsp;Thilo Krill,&nbsp;Florian Reich\",\"doi\":\"10.1002/jgt.23114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A digraph <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n <annotation> $H$</annotation>\\n </semantics></math> is called <i>ubiquitous</i> if every digraph <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>D</mi>\\n </mrow>\\n <annotation> $D$</annotation>\\n </semantics></math> that contains <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n <annotation> $k$</annotation>\\n </semantics></math> vertex-disjoint copies of <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n <annotation> $H$</annotation>\\n </semantics></math> for every <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>k</mi>\\n <mo>∈</mo>\\n <mi>N</mi>\\n </mrow>\\n <annotation> $k\\\\in {\\\\mathbb{N}}$</annotation>\\n </semantics></math> also contains infinitely many vertex-disjoint copies of <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n <annotation> $H$</annotation>\\n </semantics></math>. We characterise which digraphs with rays as underlying undirected graphs are ubiquitous.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23114\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如果每个数图都包含顶点相邻的"...... "的副本,并且也包含无限多顶点相邻的"...... "的副本,那么这个数图就叫做 "无处不在 "数图。 我们将描述哪些以射线为底层无向图的数图是无处不在的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Ubiquity of oriented rays

A digraph H $H$ is called ubiquitous if every digraph D $D$ that contains k $k$ vertex-disjoint copies of H $H$ for every k N $k\in {\mathbb{N}}$ also contains infinitely many vertex-disjoint copies of H $H$ . We characterise which digraphs with rays as underlying undirected graphs are ubiquitous.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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