Journal of Graph Theory最新文献

{"title":"Weak Rainbow Saturation Numbers of Graphs","authors":"Xihe Li, Jie Ma, Tianying Xie","doi":"10.1002/jgt.23211","DOIUrl":"https://doi.org/10.1002/jgt.23211","url":null,"abstract":"<div>\u0000 \u0000 <p>For a fixed graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23211:jgt23211-math-0001\" wiley:location=\"equation/jgt23211-math-0001.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>, we say that an edge-colored graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23211:jgt23211-math-0002\" wiley:location=\"equation/jgt23211-math-0002.png\"><mrow><mrow><mi>G</mi></mrow></mrow></math></annotation>\u0000 </semantics></math> is <i>weakly</i> <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23211:jgt23211-math-0003\" wiley:location=\"equation/jgt23211-math-0003.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>-<i>rainbow saturated</i> if there exists an ordering <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>e</mi>\u0000 \u0000 <mn>1</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>e</mi>\u0000 \u0000 <mn>2</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mo>…</mo>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>e</mi>\u0000 \u0000 <mi>m</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23211:jgt23211-math-0004\" wiley:location=\"equation/jgt23211-math-0004.png\"><mrow><mrow><msub><mi>e</mi><mn>1</mn></msub><mo>,</mo><msub><mi>e</mi><mn>2</mn></msub><mo>,</mo><mo>unicode{","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 1","pages":"35-42"},"PeriodicalIF":0.9,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143612342","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}

{"title":"Positive Co-Degree Turán Number for C5 and C5−","authors":"Zhuo Wu","doi":"10.1002/jgt.23206","DOIUrl":"https://doi.org/10.1002/jgt.23206","url":null,"abstract":"<p>The <i>minimum positive co-degree</i> <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msubsup>\u0000 <mi>δ</mi>\u0000 \u0000 <mrow>\u0000 <mi>r</mi>\u0000 \u0000 <mo>−</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 \u0000 <mo>+</mo>\u0000 </msubsup>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>H</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23206:jgt23206-math-0001\" wiley:location=\"equation/jgt23206-math-0001.png\"><mrow><mrow><msubsup><mi>unicode{x003B4}</mi><mrow><mi>r</mi><mo>unicode{x02212}</mo><mn>1</mn></mrow><mo>unicode{x0002B}</mo></msubsup><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow></mrow></mrow></math></annotation>\u0000 </semantics></math> of a nonempty <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>r</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23206:jgt23206-math-0002\" wiley:location=\"equation/jgt23206-math-0002.png\"><mrow><mrow><mi>r</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>-graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23206:jgt23206-math-0003\" wiley:location=\"equation/jgt23206-math-0003.png\"><mrow><mrow><mi>H</mi></mrow></mrow></math></annotation>\u0000 </semantics></math> is the maximum <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt2","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 1","pages":"25-30"},"PeriodicalIF":0.9,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23206","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143612490","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}

{"title":"C10 Has Positive Turán Density in the Hypercube","authors":"Alexandr Grebennikov, João Pedro Marciano","doi":"10.1002/jgt.23217","DOIUrl":"https://doi.org/10.1002/jgt.23217","url":null,"abstract":"<div>\u0000 \u0000 <p>The <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23217:jgt23217-math-0001\" wiley:location=\"equation/jgt23217-math-0001.png\"><mrow><mrow><mi>n</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>-dimensional hypercube <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>Q</mi>\u0000 \u0000 <mi>n</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23217:jgt23217-math-0002\" wiley:location=\"equation/jgt23217-math-0002.png\"><mrow><mrow><msub><mi>Q</mi><mi>n</mi></msub></mrow></mrow></math></annotation>\u0000 </semantics></math> is a graph with vertex set <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msup>\u0000 <mrow>\u0000 <mo>{</mo>\u0000 \u0000 <mrow>\u0000 <mn>0</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 \u0000 <mo>}</mo>\u0000 </mrow>\u0000 \u0000 <mi>n</mi>\u0000 </msup>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23217:jgt23217-math-0003\" wiley:location=\"equation/jgt23217-math-0003.png\"><mrow><mrow><msup><mrow><mo class=\"MathClass-open\">{</mo><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow><mo class=\"MathClass-close\">}</mo></mrow><mi>n</mi></msup></mrow></mrow></math></annotation>\u0000 </semantics></math> such that there is an edge between two vertices if and only if they differ in exactly one coordinate. For any graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23217:j","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 1","pages":"31-34"},"PeriodicalIF":0.9,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143612491","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}

{"title":"Extremal Problems for a Matching and Any Other Graph","authors":"Xiutao Zhu, Yaojun Chen","doi":"10.1002/jgt.23210","DOIUrl":"https://doi.org/10.1002/jgt.23210","url":null,"abstract":"<div>\u0000 \u0000 <p>For a family of graphs <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>ℱ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23210:jgt23210-math-0001\" wiley:location=\"equation/jgt23210-math-0001.png\"><mrow><mrow><mi class=\"MJX-tex-caligraphic\" mathvariant=\"normal\">unicode{x02131}</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>, a graph is called <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>ℱ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23210:jgt23210-math-0002\" wiley:location=\"equation/jgt23210-math-0002.png\"><mrow><mrow><mi class=\"MJX-tex-caligraphic\" mathvariant=\"normal\">unicode{x02131}</mi></mrow></mrow></math></annotation>\u0000 </semantics></math>-free if it does not contain any member of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>ℱ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23210:jgt23210-math-0003\" wiley:location=\"equation/jgt23210-math-0003.png\"><mrow><mrow><mi class=\"MJX-tex-caligraphic\" mathvariant=\"normal\">unicode{x02131}</mi></mrow></mrow></math></annotation>\u0000 </semantics></math> as a subgraph. The generalized Turán number <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mtext>ex</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>r</mi>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>ℱ</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> <math xmlns=\"http://www.w3.org/1998/Math/MathML\" altimg=\"urn:x-wiley:03649024:media:jgt23210:jgt23210-math-0004\" wiley:location=\"equation/jgt23210-math-0004.png\"&gt","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 1","pages":"19-24"},"PeriodicalIF":0.9,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143612533","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}

{"title":"A Construction of a 3/2-Tough Plane Triangulation With No 2-Factor","authors":"Songling Shan","doi":"10.1002/jgt.23209","DOIUrl":"https://doi.org/10.1002/jgt.23209","url":null,"abstract":"<div>\u0000 \u0000 <p>In 1956, Tutte proved the celebrated theorem that every 4-connected planar graph is Hamiltonian. This result implies that every more than <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mfrac>\u0000 <mn>3</mn>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics>\u0000 </mrow>\u0000 <annotation> $frac{3}{2}$</annotation>\u0000 </semantics></math>-tough planar graph on at least three vertices is Hamiltonian and so has a 2-factor. Owens in 1999 constructed non-Hamiltonian maximal planar graphs of toughness arbitrarily close to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mfrac>\u0000 <mn>3</mn>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics>\u0000 </mrow>\u0000 <annotation> $frac{3}{2}$</annotation>\u0000 </semantics></math> and asked whether there exists a maximal non-Hamiltonian planar graph of toughness exactly <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mfrac>\u0000 <mn>3</mn>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics>\u0000 </mrow>\u0000 <annotation> $frac{3}{2}$</annotation>\u0000 </semantics></math>. In fact, the graphs Owens constructed do not even contain a 2-factor. Thus the toughness of exactly <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mfrac>\u0000 <mn>3</mn>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics>\u0000 </mrow>\u0000 <annotation> $frac{3}{2}$</annotation>\u0000 </semantics></math> is the only case left in asking the existence of 2-factors in tough planar graphs. This question was also asked by Bauer, Broersma, and Schmeichel in a survey. In this paper, we close this gap by cons","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 1","pages":"5-18"},"PeriodicalIF":0.9,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143612531","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}

{"title":"Equitable List Coloring of Planar Graphs With Given Maximum Degree","authors":"H. A. Kierstead, Alexandr Kostochka, Zimu Xiang","doi":"10.1002/jgt.23203","DOIUrl":"https://doi.org/10.1002/jgt.23203","url":null,"abstract":"<p>If <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>L</mi>\u0000 </mrow>\u0000 <annotation> $L$</annotation>\u0000 </semantics></math> is a list assignment of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>r</mi>\u0000 </mrow>\u0000 <annotation> $r$</annotation>\u0000 </semantics></math> colors to each vertex of an <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math>-vertex graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math>, then an <i>equitable</i> <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>L</mi>\u0000 </mrow>\u0000 <annotation> $L$</annotation>\u0000 </semantics></math>-<i>coloring</i> of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> is a proper coloring of vertices of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> from their lists such that no color is used more than <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>⌈</mo>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 <mo>/</mo>\u0000 <mi>r</mi>\u0000 </mrow>\u0000 <mo>⌉</mo>\u0000 </mrow>\u0000 <annotation> $lceil n/rrceil $</annotation>\u0000 </semantics></math> times. A graph is <i>equitably</i> <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>r</mi>\u0000 </mrow>\u0000 <annotation> $r$</annotation>\u0000 </semantics></math>-<i>choosable</i> if it has an equitable <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>L</mi>\u0000 </mrow>\u0000 <annotation> $L$</annotation>\u0000 </semantics></math>-coloring for every <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>r</mi>\u0000 </mrow>\u0000 <annotation> $r$</annotation>\u0000 </semantics></math>-list assignment <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>L</mi>\u0000 </mrow>\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 4","pages":"832-838"},"PeriodicalIF":0.9,"publicationDate":"2024-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143456080","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}

{"title":"On the Pre- and Post-Positional Semi-Random Graph Processes","authors":"Pu Gao, Hidde Koerts","doi":"10.1002/jgt.23202","DOIUrl":"https://doi.org/10.1002/jgt.23202","url":null,"abstract":"<p>We study the semi-random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi-random graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> that has property <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{P}}$</annotation>\u0000 </semantics></math>, for the following examples of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{P}}$</annotation>\u0000 </semantics></math>: (1) <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{P}}$</annotation>\u0000 </semantics></math> is the set of graphs containing a fixed <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>d</mi>\u0000 </mrow>\u0000 <annotation> $d$</annotation>\u0000 </semantics></math>-degenerate subgraph, where <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>d</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> $dge 1$</annotation>\u0000 </semantics></math> is fixed and (2) <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{P}}$</annotation>\u0000 </semantics></math> is the set of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math>-connected graphs, where <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> $kge 1$</annotation>\u0000 </semantics></math> is fixed. In particular, our result of the <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math>-connectedness above settles the open case <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 4","pages":"819-831"},"PeriodicalIF":0.9,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23202","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455949","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}

{"title":"On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph","authors":"Domagoj Bradač","doi":"10.1002/jgt.23207","DOIUrl":"https://doi.org/10.1002/jgt.23207","url":null,"abstract":"<p>Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math> vertices is at most <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>1.889</mn>\u0000 \u0000 <msup>\u0000 <mn>9</mn>\u0000 \u0000 <mi>n</mi>\u0000 </msup>\u0000 </mrow>\u0000 <annotation> $1.889{9}^{n}$</annotation>\u0000 </semantics></math> for large enough <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math>.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 4","pages":"817-818"},"PeriodicalIF":0.9,"publicationDate":"2024-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23207","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455745","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}

{"title":"Hypergraph Anti-Ramsey Theorems","authors":"Xizhi Liu,&nbsp;Jialei Song","doi":"10.1002/jgt.23204","DOIUrl":"https://doi.org/10.1002/jgt.23204","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;The anti-Ramsey number &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mtext&gt;ar&lt;/mtext&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;F&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;\u0000 $text{ar}(n,F)$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt; of an &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $r$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt;-graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $F$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt; is the minimum number of colors needed to color the complete &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $n$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt;-vertex &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $r$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt;-graph to ensure the existence of a rainbow copy of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $F$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt;. We establish a removal-type result for the anti-Ramsey problem of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $F$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt; when &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;\u0000 $F$\u0000&lt;/annotation&gt;\u0000 &lt;/semantics&gt;\u0000 &lt;/math&gt; is the expansion of a hypergraph with a smaller uniformity. We present two applications of this result. First, we refine the general bound &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 \u0000 &lt;semantics&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mtext&gt;ar&lt;/mtext&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 4","pages":"808-816"},"PeriodicalIF":0.9,"publicationDate":"2024-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455744","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}

{"title":"Small Planar Hypohamiltonian Graphs","authors":"Cheng-Chen Tsai","doi":"10.1002/jgt.23205","DOIUrl":"https://doi.org/10.1002/jgt.23205","url":null,"abstract":"<div>\u0000 \u0000 <p>A graph is hypohamiltonian if it is non-hamiltonian, but the deletion of every single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 40 vertices, a result due to Jooyandeh, McKay, Östergård, Pettersson, and Zamfirescu. That result is here improved upon by two planar hypohamiltonian graphs on 34 vertices. We exploited a special subgraph contained in two graphs of Jooyandeh et al., and modified it to construct the two 34-vertex graphs and six planar hypohamiltonian graphs on 37 vertices. Each of the 34-vertex graphs has 26 cubic vertices, improving upon the result of Jooyandeh et al. that planar hypohamiltonian graphs have 30 cubic vertices. We use the 34-vertex graphs to construct hypohamiltonian graphs of order 34 with crossing number 1, improving the best-known bound of 36 due to Wiener. Whether there exists a planar hypohamiltonian graph on 41 vertices was an open question. We settled this question by applying an operation introduced by Thomassen to the 37-vertex graphs to obtain several planar hypohamiltonian graphs on 41 vertices. The 25 planar hypohamiltonian graphs on 40 vertices of Jooyandeh et al. have no nontrivial automorphisms. The result is here improved upon by six planar hypohamiltonian graphs on 40 vertices with nontrivial automorphisms.</p>\u0000 </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 4","pages":"799-807"},"PeriodicalIF":0.9,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455664","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}