定向射线的普遍性

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-05-12 DOI:10.1002/jgt.23114

Florian Gut, Thilo Krill, Florian Reich

{"title":"定向射线的普遍性","authors":"Florian Gut, Thilo Krill, Florian Reich","doi":"10.1002/jgt.23114","DOIUrl":null,"url":null,"abstract":"A digraph <math>\n <semantics>\n <mrow>\n <mi>H</mi>\n </mrow>\n <annotation> $H$</annotation>\n </semantics></math> is called ubiquitous if every digraph <math>\n <semantics>\n <mrow>\n <mi>D</mi>\n </mrow>\n <annotation> $D$</annotation>\n </semantics></math> that contains <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math> vertex-disjoint copies of <math>\n <semantics>\n <mrow>\n <mi>H</mi>\n </mrow>\n <annotation> $H$</annotation>\n </semantics></math> for every <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 <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.","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"107 1","pages":"200-211"},"PeriodicalIF":0.9000,"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, Thilo Krill, Florian Reich\",\"doi\":\"10.1002/jgt.23114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A digraph <math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n <annotation> $H$</annotation>\\n </semantics></math> is called ubiquitous if every digraph <math>\\n <semantics>\\n <mrow>\\n <mi>D</mi>\\n </mrow>\\n <annotation> $D$</annotation>\\n </semantics></math> that contains <math>\\n <semantics>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n <annotation> $k$</annotation>\\n </semantics></math> vertex-disjoint copies of <math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n <annotation> $H$</annotation>\\n </semantics></math> for every <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 <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.\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"107 1\",\"pages\":\"200-211\"},\"PeriodicalIF\":0.9000,\"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\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23114\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23114","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

如果每个数图都包含顶点相邻的"...... "的副本，并且也包含无限多顶点相邻的"...... "的副本，那么这个数图就叫做 "无处不在 "数图。我们将描述哪些以射线为底层无向图的数图是无处不在的。

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

Ubiquity of oriented rays

查看原文本刊更多论文

Ubiquity of oriented rays

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

求助全文

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

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .