Discrete Mathematics最新文献

筛选
英文 中文
Large matchings in maximal 1-planar graphs 最大 1 平面图中的大匹配
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-24 DOI: 10.1016/j.disc.2024.114288
{"title":"Large matchings in maximal 1-planar graphs","authors":"","doi":"10.1016/j.disc.2024.114288","DOIUrl":"10.1016/j.disc.2024.114288","url":null,"abstract":"<div><div>It is well-known that every maximal planar graph has a matching of size at least <span><math><mfrac><mrow><mi>n</mi><mo>+</mo><mn>8</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> if <span><math><mi>n</mi><mo>≥</mo><mn>14</mn></math></span>. In this paper, we investigate similar matching-bounds for maximal <em>1-planar</em> graphs, i.e., graphs that can be drawn such that every edge has at most one crossing. In particular we show that every 3-connected simple-maximal 1-planar graph has a matching of size at least <span><math><mfrac><mrow><mn>2</mn><mi>n</mi><mo>+</mo><mn>6</mn></mrow><mrow><mn>5</mn></mrow></mfrac></math></span>; the bound decreases to <span><math><mfrac><mrow><mn>3</mn><mi>n</mi><mo>+</mo><mn>14</mn></mrow><mrow><mn>10</mn></mrow></mfrac></math></span> if the graph need not be 3-connected. We also give (weaker) bounds when the graph comes with a fixed 1-planar drawing or is not simple. All our bounds are tight in the sense that some graph that satisfies the restrictions has no bigger matching.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534361","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
The decycling number of a line graph 折线图的去周期数
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-22 DOI: 10.1016/j.disc.2024.114291
{"title":"The decycling number of a line graph","authors":"","doi":"10.1016/j.disc.2024.114291","DOIUrl":"10.1016/j.disc.2024.114291","url":null,"abstract":"<div><div>The decycling number of a graph <em>G</em>, denoted by <span><math><mi>∇</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, is the number of vertices in a minimum decycling set of <em>G</em>. The line graph of <em>G</em> is denoted by <span><math><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. In this paper we show that <span><math><mi>∇</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>=</mo><mi>β</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>+</mo><mi>μ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>−</mo><mn>1</mn></math></span>, where <span><math><mi>β</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is the cycle rank of <em>G</em> and <span><math><mi>μ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is the path partition number of <em>G</em>. In particular, <span><math><mi>∇</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>=</mo><mi>β</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> if and only if <em>G</em> has a Hamilton path, and <span><math><mi>∇</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>≤</mo><mfrac><mrow><mn>2</mn><mi>n</mi></mrow><mrow><mn>3</mn></mrow></mfrac><mo>−</mo><mfrac><mrow><mn>2</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> if <em>G</em> is a cubic graph with <em>n</em> vertices, where <span><math><mi>n</mi><mo>≥</mo><mn>10</mn></math></span>. If <span><math><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is a planar graph, then we prove that <span><math><mi>∇</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>≤</mo><mfrac><mrow><mo>|</mo><mi>V</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>|</mo></mrow><mrow><mn>2</mn></mrow></mfrac></math></span>, which means that the conjecture proposed by Albertson and Berman in 1979 that the decycling number of any planar graph <em>H</em> is at most <span><math><mfrac><mrow><mo>|</mo><mi>V</mi><mo>(</mo><mi>H</mi><mo>)</mo><mo>|</mo></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> holds for a planar line graph. If <em>G</em> is a connected graph of order <em>n</em> which is 2-cell embedded on the orientable surface <span><math><msub><mrow><mo>∑</mo></mrow><mrow><mi>g</mi></mrow></msub></math></span> (or the non-orientable surface <span><math><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>k</mi></mrow><mrow><mo>′</mo></mrow></msubsup></math></span>), then we show that <span><math><mi>∇</mi><mo>(</mo><mi>L</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>)</mo><mo>≤</mo><mn>2</mn><mi>n</mi><mo>+</mo><mi>l</mi><mo>−</mo><mn>7</mn><mo>+</mo><mn>6</mn><mi>g</mi></math></span> (or <span><math><mn>2</mn><mi>n</mi><mo>+</mo><mi>l</mi><mo>−</mo><mn>7</mn><mo>+</mo><mn>3</mn><mi>k</mi></math></span>) if <em>G</em> has a spanning tree with <em>l</em> leaves. Our bounds are tight for <span><math><mi>l</mi><mo>=</mo><mn>2</mn></math></span>.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534363","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
A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees 阿尔多斯-布罗德算法和威尔逊算法之间的瞬时等价关系以及生成均匀生成树的两阶段框架
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-22 DOI: 10.1016/j.disc.2024.114285
{"title":"A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees","authors":"","doi":"10.1016/j.disc.2024.114285","DOIUrl":"10.1016/j.disc.2024.114285","url":null,"abstract":"<div><div>The <em>Aldous-Broder</em> and <em>Wilson</em> are two well-known algorithms for generating uniform spanning trees (USTs) based on random walks. This work studies their transient relationship by introducing the notion of <em>branches</em>—paths generated by the two algorithms on particular stopping times, in order to show that the trees built by the two algorithms when running on a complete graph are statistically equivalent on these stopping times. This leads to a hybrid algorithm that can generate USTs faster than either of the two algorithms. The idea is generalized to a two-stage framework to generate USTs on arbitrary graphs. The feasibility of the framework is shown through various examples, including some edge transitive graphs where the average running time can be 25% smaller than <em>Wilson</em> to generate USTs. Results obtained through numerical simulations of the framework on complete graphs and hypercubes illustrate the findings.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534360","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
2-Distance (Δ + 1)-coloring of sparse graphs using the potential method 使用势能法对稀疏图进行 2-Distance (Δ + 1) 着色
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-21 DOI: 10.1016/j.disc.2024.114292
{"title":"2-Distance (Δ + 1)-coloring of sparse graphs using the potential method","authors":"","doi":"10.1016/j.disc.2024.114292","DOIUrl":"10.1016/j.disc.2024.114292","url":null,"abstract":"<div><div>A 2-distance <em>k</em>-coloring of a graph is a proper <em>k</em>-coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance (<span><math><mi>Δ</mi><mo>+</mo><mn>1</mn></math></span>)-coloring for graphs with maximum average degree less than <span><math><mfrac><mrow><mn>18</mn></mrow><mrow><mn>7</mn></mrow></mfrac></math></span> and maximum degree <span><math><mi>Δ</mi><mo>≥</mo><mn>7</mn></math></span>. As a corollary, every planar graph with girth at least 9 and <span><math><mi>Δ</mi><mo>≥</mo><mn>7</mn></math></span> admits a 2-distance <span><math><mo>(</mo><mi>Δ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-coloring. The proof uses the potential method to reduce new configurations compared to classic approaches on 2-distance coloring.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529717","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
On the size and structure of t-representable sumsets 关于可表示 t 的和集的大小和结构
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-21 DOI: 10.1016/j.disc.2024.114295
{"title":"On the size and structure of t-representable sumsets","authors":"","doi":"10.1016/j.disc.2024.114295","DOIUrl":"10.1016/j.disc.2024.114295","url":null,"abstract":"<div><div>Let <span><math><mi>A</mi><mo>⊆</mo><msub><mrow><mi>Z</mi></mrow><mrow><mo>≥</mo><mn>0</mn></mrow></msub></math></span> be a finite set with minimum element 0, maximum element <em>m</em>, and <em>ℓ</em> elements strictly in between. Write <span><math><msup><mrow><mo>(</mo><mi>h</mi><mi>A</mi><mo>)</mo></mrow><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow></msup></math></span> for the set of integers that can be written in at least <em>t</em> ways as a sum of <em>h</em> elements of <em>A</em>. We prove that <span><math><msup><mrow><mo>(</mo><mi>h</mi><mi>A</mi><mo>)</mo></mrow><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow></msup></math></span> is “structured” for<span><span><span><math><mi>h</mi><mo>≥</mo><mo>(</mo><mn>1</mn><mo>+</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>e</mi></mrow></mfrac><mi>m</mi><mi>ℓ</mi><msup><mrow><mi>t</mi></mrow><mrow><mn>1</mn><mo>/</mo><mi>ℓ</mi></mrow></msup></math></span></span></span> (as <span><math><mi>ℓ</mi><mo>→</mo><mo>∞</mo></math></span>, <span><math><msup><mrow><mi>t</mi></mrow><mrow><mn>1</mn><mo>/</mo><mi>ℓ</mi></mrow></msup><mo>→</mo><mo>∞</mo></math></span>), and prove a similar theorem on the size and structure of <span><math><mi>A</mi><mo>⊆</mo><msup><mrow><mi>Z</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> for <em>h</em> sufficiently large. Moreover, we construct a family of sets <span><math><mi>A</mi><mo>=</mo><mi>A</mi><mo>(</mo><mi>m</mi><mo>,</mo><mi>ℓ</mi><mo>,</mo><mi>t</mi><mo>)</mo><mo>⊆</mo><msub><mrow><mi>Z</mi></mrow><mrow><mo>≥</mo><mn>0</mn></mrow></msub></math></span> for which <span><math><msup><mrow><mo>(</mo><mi>h</mi><mi>A</mi><mo>)</mo></mrow><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow></msup></math></span> is not structured for <span><math><mi>h</mi><mo>≪</mo><mi>m</mi><mi>ℓ</mi><msup><mrow><mi>t</mi></mrow><mrow><mn>1</mn><mo>/</mo><mi>ℓ</mi></mrow></msup></math></span>.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529639","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
On the number of small Steiner triple systems with Veblen points 关于具有维布伦点的小型斯坦纳三重系统的数量
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-21 DOI: 10.1016/j.disc.2024.114294
{"title":"On the number of small Steiner triple systems with Veblen points","authors":"","doi":"10.1016/j.disc.2024.114294","DOIUrl":"10.1016/j.disc.2024.114294","url":null,"abstract":"<div><div>The concept of <em>Schreier extensions</em> of loops was introduced in the general case in <span><span>[11]</span></span> and, more recently, it has been explored in the context of Steiner loops in <span><span>[6]</span></span>. In the latter case, it gives a powerful method for constructing Steiner triple systems containing Veblen points. Counting all Steiner triple systems of order <em>v</em> is an open problem for <span><math><mi>v</mi><mo>&gt;</mo><mn>21</mn></math></span>. In this paper, we investigate the number of Steiner triple systems of order 19, 27 and 31 containing Veblen points and we present some examples.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529718","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
The average connectivity matrix of a graph 图形的平均连接矩阵
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-18 DOI: 10.1016/j.disc.2024.114290
{"title":"The average connectivity matrix of a graph","authors":"","doi":"10.1016/j.disc.2024.114290","DOIUrl":"10.1016/j.disc.2024.114290","url":null,"abstract":"&lt;div&gt;&lt;div&gt;For a graph &lt;em&gt;G&lt;/em&gt; and for two distinct vertices &lt;em&gt;u&lt;/em&gt; and &lt;em&gt;v&lt;/em&gt;, let &lt;span&gt;&lt;math&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; be the maximum number of vertex-disjoint paths joining &lt;em&gt;u&lt;/em&gt; and &lt;em&gt;v&lt;/em&gt; in &lt;em&gt;G&lt;/em&gt;. The average connectivity matrix of an &lt;em&gt;n&lt;/em&gt;-vertex connected graph &lt;em&gt;G&lt;/em&gt;, written &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, is an &lt;span&gt;&lt;math&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;×&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; matrix whose &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-entry is &lt;span&gt;&lt;math&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;/&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and let &lt;span&gt;&lt;math&gt;&lt;mi&gt;ρ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; be the spectral radius of &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. In this paper, we investigate some spectral properties of the matrix. In particular, we prove that for any &lt;em&gt;n&lt;/em&gt;-vertex connected graph &lt;em&gt;G&lt;/em&gt;, we have &lt;span&gt;&lt;math&gt;&lt;mi&gt;ρ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/math&gt;&lt;/span&gt;, which implies a result of Kim and O &lt;span&gt;&lt;span&gt;[8]&lt;/span&gt;&lt;/span&gt; stating that for any connected graph &lt;em&gt;G&lt;/em&gt;, we have &lt;span&gt;&lt;math&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is the maximum size of a matching in &lt;em&gt;G&lt;/em&gt;; equality holds only when &lt;em&gt;G&lt;/em&gt; is a complete graph with an odd number of vertices. Also, for bipartite graphs, we improve the bound, namely &lt;span&gt;&lt;math&gt;&lt;mi&gt;ρ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mover&gt;&lt;mrow&gt;&lt;mi&gt;κ&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;‾&lt;/mo&gt;&lt;/mover&gt;&lt;/mro","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534359","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
Equitable coloring in 1-planar graphs 1 平面图形中的等价着色
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-18 DOI: 10.1016/j.disc.2024.114286
{"title":"Equitable coloring in 1-planar graphs","authors":"","doi":"10.1016/j.disc.2024.114286","DOIUrl":"10.1016/j.disc.2024.114286","url":null,"abstract":"<div><div>For every <span><math><mi>r</mi><mo>≥</mo><mn>13</mn></math></span>, we show every 1-planar graph <em>G</em> with <span><math><mi>Δ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>≤</mo><mi>r</mi></math></span> has an equitable <em>r</em>-coloring.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534357","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
Weak submodularity implies localizability: Local search for constrained non-submodular function maximization 弱次模化意味着本地化:受约束非次模块化函数最大化的局部搜索
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-18 DOI: 10.1016/j.disc.2024.114287
{"title":"Weak submodularity implies localizability: Local search for constrained non-submodular function maximization","authors":"","doi":"10.1016/j.disc.2024.114287","DOIUrl":"10.1016/j.disc.2024.114287","url":null,"abstract":"<div><div>Local search algorithms are commonly employed to address a variety of problems in the domain of operations research and combinatorial optimization. Most of the literature on the maximization of constrained monotone non-submodular functions is based on a greedy strategy, and few designs of local search approach are involved. In this paper, we explore the problem of maximizing a monotone non-submodular function under a <em>p</em>-matroid (<span><math><mi>p</mi><mo>≥</mo><mn>1</mn></math></span>) constraint with local search algorithms. And we indicate that weak submodularity implies localizability of set function optimization which can be used to offer provable approximation guarantees of local search algorithms.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534358","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
Localized version of hypergraph Erdős-Gallai Theorem 超图厄尔多斯-加莱定理的本地化版本
IF 0.7 3区 数学
Discrete Mathematics Pub Date : 2024-10-18 DOI: 10.1016/j.disc.2024.114293
{"title":"Localized version of hypergraph Erdős-Gallai Theorem","authors":"","doi":"10.1016/j.disc.2024.114293","DOIUrl":"10.1016/j.disc.2024.114293","url":null,"abstract":"<div><div>The weight function of an edge in an <em>n</em>-vertex uniform hypergraph <span><math><mi>H</mi></math></span> is defined with respect to the number of edges in the longest Berge path containing the edge. We prove that the summation of the weight function values for all edges in <span><math><mi>H</mi></math></span> is at most <em>n</em>, and characterize all extremal hypergraphs that attain this bound. This result strengthens and extends the hypergraph version of the classic Erdős-Gallai Theorem, providing a local version of this theorem.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142528661","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
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学术官方微信