改进了禁止未成年人使用警察号码的限制

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-10-13 DOI:10.1002/jgt.23194

Franklin Kenter, Erin Meger, Jérémie Turcotte

{"title":"改进了禁止未成年人使用警察号码的限制","authors":"Franklin Kenter, Erin Meger, Jérémie Turcotte","doi":"10.1002/jgt.23194","DOIUrl":null,"url":null,"abstract":"Andreae proved that the cop number of connected <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>H</mi>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0001\" wiley:location=\"equation/jgt23194-math-0001.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\n </semantics></math>-minor-free graphs is bounded for every graph <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>H</mi>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0002\" wiley:location=\"equation/jgt23194-math-0002.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\n </semantics></math>. In particular, the cop number is at most <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>E</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>H</mi>\n \n <mo>−</mo>\n \n <mi>h</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n \n <mo>∣</mo>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0003\" wiley:location=\"equation/jgt23194-math-0003.png\"><mrow><mrow><mo>\\unicode{x02223}</mo><mi>E</mi><mrow><mo>(</mo><mrow><mi>H</mi><mo>\\unicode{x02212}</mo><mi>h</mi></mrow><mo>)</mo></mrow><mo>\\unicode{x02223}</mo></mrow></mrow></math></annotation>\n </semantics></math> if <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>H</mi>\n \n <mo>−</mo>\n \n <mi>h</mi>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0004\" wiley:location=\"equation/jgt23194-math-0004.png\"><mrow><mrow><mi>H</mi><mo>\\unicode{x02212}</mo><mi>h</mi></mrow></mrow></math></annotation>\n </semantics></math> contains no isolated vertex, where <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>h</mi>\n \n <mo>∈</mo>\n \n <mi>V</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mi>H</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0005\" wiley:location=\"equation/jgt23194-math-0005.png\"><mrow><mrow><mi>h</mi><mo>\\unicode{x02208}</mo><mi>V</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></mrow></math></annotation>\n </semantics></math>. The main result of this paper is an improvement on this bound, which is most significant when <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>H</mi>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0006\" wiley:location=\"equation/jgt23194-math-0006.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\n </semantics></math> is small or sparse, for instance, when <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>H</mi>\n \n <mo>−</mo>\n \n <mi>h</mi>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0007\" wiley:location=\"equation/jgt23194-math-0007.png\"><mrow><mrow><mi>H</mi><mo>\\unicode{x02212}</mo><mi>h</mi></mrow></mrow></math></annotation>\n </semantics></math> can be obtained from another graph by multiple edge subdivisions. Some consequences of this result are improvements on the upper bound for the cop number of <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>K</mi>\n \n <mrow>\n <mn>3</mn>\n \n <mo>,</mo>\n \n <mi>t</mi>\n </mrow>\n </msub>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0008\" wiley:location=\"equation/jgt23194-math-0008.png\"><mrow><mrow><msub><mi>K</mi><mrow><mn>3</mn><mo>,</mo><mi>t</mi></mrow></msub></mrow></mrow></math></annotation>\n </semantics></math>-minor-free graphs, <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>K</mi>\n \n <mrow>\n <mn>2</mn>\n \n <mo>,</mo>\n \n <mi>t</mi>\n </mrow>\n </msub>\n </mrow>\n </mrow>\n <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0009\" wiley:location=\"equation/jgt23194-math-0009.png\"><mrow><mrow><msub><mi>K</mi><mrow><mn>2</mn><mo>,</mo><mi>t</mi></mrow></msub></mrow></mrow></math></annotation>\n </semantics></math>-minor-free graphs and linklessly embeddable graphs.","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 3","pages":"620-646"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved bounds on the cop number when forbidding a minor\",\"authors\":\"Franklin Kenter, Erin Meger, Jérémie Turcotte\",\"doi\":\"10.1002/jgt.23194\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Andreae proved that the cop number of connected <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0001\\\" wiley:location=\\\"equation/jgt23194-math-0001.png\\\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\\n </semantics></math>-minor-free graphs is bounded for every graph <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0002\\\" wiley:location=\\\"equation/jgt23194-math-0002.png\\\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\\n </semantics></math>. In particular, the cop number is at most <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mo>∣</mo>\\n \\n <mi>E</mi>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>H</mi>\\n \\n <mo>−</mo>\\n \\n <mi>h</mi>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n \\n <mo>∣</mo>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0003\\\" wiley:location=\\\"equation/jgt23194-math-0003.png\\\"><mrow><mrow><mo>\\\\unicode{x02223}</mo><mi>E</mi><mrow><mo>(</mo><mrow><mi>H</mi><mo>\\\\unicode{x02212}</mo><mi>h</mi></mrow><mo>)</mo></mrow><mo>\\\\unicode{x02223}</mo></mrow></mrow></math></annotation>\\n </semantics></math> if <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>H</mi>\\n \\n <mo>−</mo>\\n \\n <mi>h</mi>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0004\\\" wiley:location=\\\"equation/jgt23194-math-0004.png\\\"><mrow><mrow><mi>H</mi><mo>\\\\unicode{x02212}</mo><mi>h</mi></mrow></mrow></math></annotation>\\n </semantics></math> contains no isolated vertex, where <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>h</mi>\\n \\n <mo>∈</mo>\\n \\n <mi>V</mi>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mi>H</mi>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0005\\\" wiley:location=\\\"equation/jgt23194-math-0005.png\\\"><mrow><mrow><mi>h</mi><mo>\\\\unicode{x02208}</mo><mi>V</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></mrow></math></annotation>\\n </semantics></math>. The main result of this paper is an improvement on this bound, which is most significant when <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>H</mi>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0006\\\" wiley:location=\\\"equation/jgt23194-math-0006.png\\\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\\n </semantics></math> is small or sparse, for instance, when <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>H</mi>\\n \\n <mo>−</mo>\\n \\n <mi>h</mi>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0007\\\" wiley:location=\\\"equation/jgt23194-math-0007.png\\\"><mrow><mrow><mi>H</mi><mo>\\\\unicode{x02212}</mo><mi>h</mi></mrow></mrow></math></annotation>\\n </semantics></math> can be obtained from another graph by multiple edge subdivisions. Some consequences of this result are improvements on the upper bound for the cop number of <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <msub>\\n <mi>K</mi>\\n \\n <mrow>\\n <mn>3</mn>\\n \\n <mo>,</mo>\\n \\n <mi>t</mi>\\n </mrow>\\n </msub>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0008\\\" wiley:location=\\\"equation/jgt23194-math-0008.png\\\"><mrow><mrow><msub><mi>K</mi><mrow><mn>3</mn><mo>,</mo><mi>t</mi></mrow></msub></mrow></mrow></math></annotation>\\n </semantics></math>-minor-free graphs, <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <msub>\\n <mi>K</mi>\\n \\n <mrow>\\n <mn>2</mn>\\n \\n <mo>,</mo>\\n \\n <mi>t</mi>\\n </mrow>\\n </msub>\\n </mrow>\\n </mrow>\\n <annotation> <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" altimg=\\\"urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0009\\\" wiley:location=\\\"equation/jgt23194-math-0009.png\\\"><mrow><mrow><msub><mi>K</mi><mrow><mn>2</mn><mo>,</mo><mi>t</mi></mrow></msub></mrow></mrow></math></annotation>\\n </semantics></math>-minor-free graphs and linklessly embeddable graphs.\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"108 3\",\"pages\":\"620-646\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23194\",\"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.23194","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

Andreae证明了连接的H&lt； math xmlns="http://www.w3.org/1998/Math/MathML" altimg="urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0001" wiley:location="equation/jgt23194-math-0001.png"><mrow>< /mrow></mrow></ mrow></mrow></ mrow></mrow></math&gt；-对每个图H&lt； math xmlns="http://www.w3.org/1998/Math/MathML" altimg="urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0002" wiley:location="equation/jgt23194-math-0002.png"><mrow>< /mrow></mrow></ mrow></mrow></ mrow></mrow></ mrow></math&gt；．特别是,cop数至多为∣E （H−H）∣<math xmlns="http://www.w3.org/1998/Math/MathML" altimg=“urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0003”威利:位置= "方程/ jgt23194 -数学- 0003. png”祝辞& lt; mrow> & lt; mrow> & lt; mo> \ unicode {x02223} & lt; / mo> & lt; mi> E< / mi> & lt; mrow> & lt; mo> (& lt; / mo> & lt; mrow> & lt; mi> H< / mi> & lt; mo> \ unicode {x02212} & lt; / mo> & lt; mi> H< / mi> & lt; / mrow> & lt; mo>) & lt; / mo> & lt; / mrow> & lt; mo> \ unicode {x02223} & lt; / mo> & lt; / mrow> & lt; / mrow> & lt; / math>if H−H <math xmlns="http://www.w3.org/1998/Math/MathML" altimg=“urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0004”威利:位置= "方程/ jgt23194 -数学- 0004. png”祝辞& lt; mrow> & lt; mrow> & lt; mi> H< / mi> & lt; mo> \ unicode {x02212} & lt; / mo> & lt; mi> H< / mi> & lt; / mrow> & lt; / mrow> & lt; / math>不包含孤立顶点，其中h∈V (h) <math xmlns=“http://www.w3.org/1998/Math/MathML”altimg = " urn: x-wiley: 03649024:媒体:jgt23194: jgt23194 -数学- 0005“威利:位置=“方程/ jgt23194 -数学- 0005. - png”祝辞& lt; mrow> & lt; mrow> & lt; mi> h< / mi> & lt; mo> \ unicode {x02208} & lt; / mo> & lt; mi> V< / mi> & lt; mrow> & lt; mo> (& lt; / mo> & lt; mi&gt h< / mi> & lt; mo>) & lt; / mo> & lt; / mrow> & lt; / mrow> & lt; / mrow> & lt; / math>．本文的主要结果是对这一边界的改进，当H&lt； math xmlns="http://www.w3.org/1998/Math/MathML" altimg="urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0006" wiley:location="equation/jgt23194-math-0006.png"><mrow>< /mrow></mrow></ mrow></mrow></math&gt；是小的或稀疏的，当H−H &lt；math xmlns="http://www.w3.org/1998/Math/MathML" altimg=“urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0007”威利:位置= "方程/ jgt23194 -数学- 0007. png”祝辞& lt; mrow> & lt; mrow> & lt; mi> H< / mi> & lt; mo> \ unicode {x02212} & lt; / mo> & lt; mi> H< / mi> & lt; / mrow> & lt; / mrow> & lt; / math>可以从另一个图中通过多个边细分得到。该结果的一些结果是对k3的cop数上界的改进，t <math xmlns="http://www.w3.org/1998/Math/MathML" altimg=“urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0008”威利:位置= "方程/ jgt23194 -数学- 0008. png”祝辞& lt; mrow> & lt; mrow> & lt; msub> & lt; mi> K< / mi> & lt; mrow> & lt; mn> 3 & lt; / mn> & lt; mo> & lt; / mo> & lt; mi> t< / mi> & lt; / mrow> & lt; / msub> & lt; / mrow> & lt; / mrow> & lt; / math>-无次元图，k2，t <math xmlns="http://www.w3.org/1998/Math/MathML" altimg=“urn:x-wiley:03649024:media:jgt23194:jgt23194-math-0009”威利:位置= "方程/ jgt23194 -数学- 0009. png”祝辞& lt; mrow> & lt; mrow> & lt; msub> & lt; mi> K< / mi> & lt; mrow> & lt; mn> 2 & lt; / mn> & lt; mo> & lt; / mo> & lt; mi> t< / mi> & lt; / mrow> & lt; / msub> & lt; / mrow> & lt; / mrow> & lt; / math>无次要图和无链接嵌入图。

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

查看原文本刊更多论文

Improved bounds on the cop number when forbidding a minor

Andreae proved that the cop number of connected $H$ -minor-free graphs is bounded for every graph $H$ . In particular, the cop number is at most $∣ E (H - h) ∣$ if $H - h$ contains no isolated vertex, where $h \in V (H)$ . The main result of this paper is an improvement on this bound, which is most significant when $H$ is small or sparse, for instance, when $H - h$ can be obtained from another graph by multiple edge subdivisions. Some consequences of this result are improvements on the upper bound for the cop number of $K_{3, t}$ -minor-free graphs, $K_{2, t}$ -minor-free graphs and linklessly embeddable graphs.

求助全文

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

来源期刊

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 .