Journal of Graph Theory最新文献

筛选
英文 中文
Counting circuit double covers
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-10-02 DOI: 10.1002/jgt.23187
Radek Hušek, Robert Šámal
{"title":"Counting circuit double covers","authors":"Radek Hušek,&nbsp;Robert Šámal","doi":"10.1002/jgt.23187","DOIUrl":"https://doi.org/10.1002/jgt.23187","url":null,"abstract":"<p>We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>C</mi>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${C}_{k}$</annotation>\u0000 </semantics></math> for some <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math>) instead of cycles (graphs with all degrees even). We give an almost-exponential lower bound for graphs with a surface embedding of representativity at least 4. We also prove an exponential lower bound for planar graphs. We conjecture that any bridgeless cubic graph has at least <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msup>\u0000 <mn>2</mn>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>/</mo>\u0000 \u0000 <mn>2</mn>\u0000 \u0000 <mo>−</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 </msup>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${2}^{n/2-1}$</annotation>\u0000 </semantics></math> circuit double covers and we show an infinite class of graphs for which this bound is tight.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"374-395"},"PeriodicalIF":0.9,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23187","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-Hamiltonian Cartesian products of two even dicycles
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-30 DOI: 10.1002/jgt.23185
Kenta Noguchi, Carol T. Zamfirescu
{"title":"Non-Hamiltonian Cartesian products of two even dicycles","authors":"Kenta Noguchi,&nbsp;Carol T. Zamfirescu","doi":"10.1002/jgt.23185","DOIUrl":"https://doi.org/10.1002/jgt.23185","url":null,"abstract":"<p>In this note it is proven that there exist infinitely many positive integers <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>a</mi>\u0000 </mrow>\u0000 <annotation> $a$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>b</mi>\u0000 </mrow>\u0000 <annotation> $b$</annotation>\u0000 </semantics></math> such that the Cartesian product of a directed cycle of length <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 \u0000 <mi>a</mi>\u0000 </mrow>\u0000 <annotation> $2a$</annotation>\u0000 </semantics></math> and a directed cycle of length <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 \u0000 <mi>b</mi>\u0000 </mrow>\u0000 <annotation> $2b$</annotation>\u0000 </semantics></math> is non-Hamiltonian. In particular, the Cartesian product of an 880-dicycle and a 4368-dicycle is non-Hamiltonian. We also prove that there is no such graph on fewer than <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>880</mn>\u0000 \u0000 <mo>⋅</mo>\u0000 \u0000 <mn>4368</mn>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mn>3</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>843</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>840</mn>\u0000 </mrow>\u0000 <annotation> $880cdot 4368=3,843,840$</annotation>\u0000 </semantics></math> vertices, which is rather astonishing.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"368-373"},"PeriodicalIF":0.9,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An extension of Nash-Williams and Tutte's Theorem
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-26 DOI: 10.1002/jgt.23189
Xuqian Fang, Daqing Yang
{"title":"An extension of Nash-Williams and Tutte's Theorem","authors":"Xuqian Fang,&nbsp;Daqing Yang","doi":"10.1002/jgt.23189","DOIUrl":"https://doi.org/10.1002/jgt.23189","url":null,"abstract":"&lt;p&gt;The celebrated Nash-Williams and Tutte's Theorem states that a graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; contains &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; edge-disjoint spanning trees if and only if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;ν&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${nu }_{f}(G)ge k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, where\u0000\u0000 &lt;/p&gt;&lt;p&gt;In this paper, we prove that, for integers &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;0&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $kge 0$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $dge 1$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;ν&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;&gt;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mfrac&gt;\u0000 &lt;mrow&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"361-367"},"PeriodicalIF":0.9,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph curvature and local discrepancy
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-24 DOI: 10.1002/jgt.23176
Paul Horn, Adam Purcilly, Alex Stevens
{"title":"Graph curvature and local discrepancy","authors":"Paul Horn,&nbsp;Adam Purcilly,&nbsp;Alex Stevens","doi":"10.1002/jgt.23176","DOIUrl":"https://doi.org/10.1002/jgt.23176","url":null,"abstract":"<p>In recent years, discrete notions of curvature have been defined and exploited to understand various geometric properties of graphs; especially regarding heat flow, and spectral properties. In this paper, we study various combinatorial properties implied by satisfying the Bakry–Émery curvature dimension inequality <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>C</mi>\u0000 \u0000 <mi>D</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>∞</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>K</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $CD(infty ,K)$</annotation>\u0000 </semantics></math>. In particular we derive a local discrepancy inequality, similar in spirit to the expander mixing lemma from spectral graph theory, which certifies a type of “local pseudo-randomness” of the edge set of the graph, for graphs satisfying a curvature lower bound. In addition, several other consequences are derived regarding graph connectivity and cycle statistics of the graph.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"337-360"},"PeriodicalIF":0.9,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Short rainbow cycles for families of matchings and triangles
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-23 DOI: 10.1002/jgt.23183
He Guo
{"title":"Short rainbow cycles for families of matchings and triangles","authors":"He Guo","doi":"10.1002/jgt.23183","DOIUrl":"https://doi.org/10.1002/jgt.23183","url":null,"abstract":"&lt;p&gt;A generalization of the famous Caccetta–Häggkvist conjecture, suggested by Aharoni, is that any family &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;…&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{ {mathcal F} }}=({F}_{1},ldots ,{F}_{n})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; of sets of edges in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${K}_{n}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, each of size &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, has a rainbow cycle of length at most &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;⌈&lt;/mo&gt;\u0000 \u0000 &lt;mfrac&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mfrac&gt;\u0000 \u0000 &lt;mo&gt;⌉&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $lceil frac{n}{k}rceil $&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. In works by the author with Aharoni and by the author with Aharoni, Berger, Chudnovsky, and Zerbib, it was shown that asymptotically this can be improved to &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;O&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;log&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $O(mathrm{log}n)$&lt;/annotation&gt;\u0000 &lt;/se","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"325-336"},"PeriodicalIF":0.9,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23183","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On two problems of defective choosability of graphs
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-23 DOI: 10.1002/jgt.23182
Jie Ma, Rongxing Xu, Xuding Zhu
{"title":"On two problems of defective choosability of graphs","authors":"Jie Ma,&nbsp;Rongxing Xu,&nbsp;Xuding Zhu","doi":"10.1002/jgt.23182","DOIUrl":"https://doi.org/10.1002/jgt.23182","url":null,"abstract":"&lt;p&gt;Given positive integers &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;p&lt;/mi&gt;\u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $pge k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, and a nonnegative integer &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $d$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, we say a graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;p&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(k,d,p)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-choosable if for every list assignment &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $L$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $| L(v)| ge k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; for each &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $vin V(G)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mo&gt;⋃&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"313-324"},"PeriodicalIF":0.9,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
d $d$ -connectivity of the random graph with restricted budget
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-18 DOI: 10.1002/jgt.23180
Lyuben Lichev
{"title":"d\u0000 \u0000 $d$\u0000 -connectivity of the random graph with restricted budget","authors":"Lyuben Lichev","doi":"10.1002/jgt.23180","DOIUrl":"https://doi.org/10.1002/jgt.23180","url":null,"abstract":"&lt;p&gt;In this short note, we consider a graph process recently introduced by Frieze, Krivelevich and Michaeli. In their model, the edges of the complete graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${K}_{n}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; are ordered uniformly at random and are then revealed consecutively to a player called Builder. At every round, Builder must decide if they accept the edge proposed at this round or not. We prove that, for every &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $dge 2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, Builder can construct a spanning &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $d$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-connected graph after &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;log&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt; &lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;/&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(1+o(1))nmathrm{log}unicode{x0200A}n/2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; rounds by accepting &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"293-312"},"PeriodicalIF":0.9,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finding dense minors using average degree 利用平均程度查找密集的未成年人
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-16 DOI: 10.1002/jgt.23169
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
{"title":"Finding dense minors using average degree","authors":"Kevin Hendrey,&nbsp;Sergey Norin,&nbsp;Raphael Steiner,&nbsp;Jérémie Turcotte","doi":"10.1002/jgt.23169","DOIUrl":"https://doi.org/10.1002/jgt.23169","url":null,"abstract":"&lt;p&gt;Motivated by Hadwiger's conjecture, we study the problem of finding the densest possible &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;-vertex minor in graphs of average degree at least &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;. We show that if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; has average degree at least &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;, it contains a minor on &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; vertices with at least &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msqrt&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msqrt&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mfenced&gt;\u0000 &lt;mfrac&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mfrac&gt;\u0000 &lt;/mfenced&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; edges. We show that this cannot be improved beyond &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mfenced&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mfrac&gt;\u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/mfrac&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mfenced&gt;\u0000 \u0000 &lt;mfenced&gt;\u0000 &lt;mfrac&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mfrac&gt;\u0000 &lt;/mfenced&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;. Finally, for &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 1","pages":"205-223"},"PeriodicalIF":0.9,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142707851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Compatible powers of Hamilton cycles in dense graphs 密集图中汉密尔顿循环的相容幂
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-16 DOI: 10.1002/jgt.23178
Xiaohan Cheng, Jie Hu, Donglei Yang
{"title":"Compatible powers of Hamilton cycles in dense graphs","authors":"Xiaohan Cheng,&nbsp;Jie Hu,&nbsp;Donglei Yang","doi":"10.1002/jgt.23178","DOIUrl":"10.1002/jgt.23178","url":null,"abstract":"&lt;p&gt;The notion of incompatibility system was first proposed by Krivelevich, Lee and Sudakov to formulate the robustness of Hamiltonicity of Dirac graphs. Given a graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;E&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G=(V,E)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, an &lt;i&gt;incompatibility system&lt;/i&gt; &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{ {mathcal F} }}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; over &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a family &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;{&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;}&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{ {mathcal F} }}={{{F}_{v}}}_{vin V}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; such that for every &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $vin V$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${F}_{v}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a family of edge pairs &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;{&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"257-273"},"PeriodicalIF":0.9,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142263967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fractional factors and component factors in graphs with isolated toughness smaller than 1 孤立韧性小于 1 的图形中的分数因子和分量因子
IF 0.9 3区 数学
Journal of Graph Theory Pub Date : 2024-09-16 DOI: 10.1002/jgt.23179
Isaak H. Wolf
{"title":"Fractional factors and component factors in graphs with isolated toughness smaller than 1","authors":"Isaak H. Wolf","doi":"10.1002/jgt.23179","DOIUrl":"10.1002/jgt.23179","url":null,"abstract":"&lt;p&gt;Let &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be a simple graph and let &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n,m$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be two integers with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;0&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;&lt;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;&lt;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $0lt mlt n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. We prove that &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;o&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;≤&lt;/mo&gt;\u0000 \u0000 &lt;mfrac&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;/mfrac&gt;\u0000 \u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $iso(G-S)le frac{n}{m}| S| $&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; for every &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;⊂&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $Ssubset V(G)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; if and only if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"274-287"},"PeriodicalIF":0.9,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23179","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142263968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信