发布求助
文献互助 智能选刊 最新文献

Graphs and Combinatorics最新文献

筛选
英文 中文
Planar Turán Numbers of Cubic Graphs and Disjoint Union of Cycles 立体图形的平面图兰数和循环的不相邻联盟
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-25 DOI: 10.1007/s00373-024-02750-3
{"title":"Planar Turán Numbers of Cubic Graphs and Disjoint Union of Cycles","authors":"","doi":"10.1007/s00373-024-02750-3","DOIUrl":"https://doi.org/10.1007/s00373-024-02750-3","url":null,"abstract":"<h3>Abstract</h3> <p>The planar Turán number of a graph <em>H</em>, denoted by <span> <span>(ex_{_mathcal {P}}(n,H))</span> </span>, is the maximum number of edges in a planar graph on <em>n</em> vertices without containing <em>H</em> as a subgraph. This notion was introduced by Dowden in 2016 and has attracted quite some attention since then; those work mainly focus on finding <span> <span>(ex_{_mathcal {P}}(n,H))</span> </span> when <em>H</em> is a cycle or Theta graph or <em>H</em> has maximum degree at least four. In this paper, we first completely determine the exact values of <span> <span>(ex_{_mathcal {P}}(n,H))</span> </span> when <em>H</em> is a cubic graph. We then prove that <span> <span>(ex_{_mathcal {P}}(n,2C_3)=lceil 5n/2rceil -5)</span> </span> for all <span> <span>(nge 6)</span> </span>, and obtain the lower bounds of <span> <span>(ex_{_mathcal {P}}(n,2C_k))</span> </span> for all <span> <span>(nge 2kge 8)</span> </span>. Finally, we also completely determine the exact values of <span> <span>(ex_{_mathcal {P}}(n,K_{2,t}))</span> </span> for all <span> <span>(tge 3)</span> </span> and <span> <span>(nge t+2)</span> </span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Infinite Families of k-Vertex-Critical ( $$P_5$$ , $$C_5$$ )-Free Graphs k 顶点临界 ( $$P_5$$ , $$C_5$$ )- 自由图的无穷族
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-25 DOI: 10.1007/s00373-024-02756-x
Ben Cameron, Chính Hoàng
{"title":"Infinite Families of k-Vertex-Critical ( $$P_5$$ , $$C_5$$ )-Free Graphs","authors":"Ben Cameron, Chính Hoàng","doi":"10.1007/s00373-024-02756-x","DOIUrl":"https://doi.org/10.1007/s00373-024-02756-x","url":null,"abstract":"<p>A graph is <i>k</i>-vertex-critical if <span>(chi (G)=k)</span> but <span>(chi (G-v)&lt;k)</span> for all <span>(vin V(G))</span>. We construct new infinite families of <i>k</i>-vertex-critical <span>((P_5,C_5))</span>-free graphs for all <span>(kge 6)</span>. Our construction generalises known constructions for 4-vertex-critical <span>(P_7)</span>-free graphs and 5-vertex-critical <span>(P_5)</span>-free graphs and is in contrast to the fact that there are only finitely many 5-vertex-critical <span>((P_5,C_5))</span>-free graphs. In fact, our construction is even more well-structured, being <span>((2P_2,K_3+P_1,C_5))</span>-free.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ramsey Numbers and Graph Parameters 拉姆齐数字和图形参数
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-25 DOI: 10.1007/s00373-024-02755-y
Vadim Lozin
{"title":"Ramsey Numbers and Graph Parameters","authors":"Vadim Lozin","doi":"10.1007/s00373-024-02755-y","DOIUrl":"https://doi.org/10.1007/s00373-024-02755-y","url":null,"abstract":"<p>According to Ramsey’s Theorem, for any natural <i>p</i> and <i>q</i> there is a minimum number <i>R</i>(<i>p</i>, <i>q</i>) such that every graph with at least <i>R</i>(<i>p</i>, <i>q</i>) vertices has either a clique of size <i>p</i> or an independent set of size <i>q</i>. In the present paper, we study Ramsey numbers <i>R</i>(<i>p</i>, <i>q</i>) for graphs in special classes. It is known that for graphs of bounded co-chromatic number Ramsey numbers are upper-bounded by a linear function of <i>p</i> and <i>q</i>. However, the exact values of <i>R</i>(<i>p</i>, <i>q</i>) are known only for classes of graphs of co-chromatic number at most 2. In this paper, we determine the exact values of Ramsey numbers for classes of graphs of co-chromatic number at most 3. It is also known that for classes of graphs of unbounded splitness the value of <i>R</i>(<i>p</i>, <i>q</i>) is lower-bounded by <span>((p-1)(q-1)+1)</span>. This lower bound coincides with the upper bound for perfect graphs and for all their subclasses of unbounded splitness. We call a class Ramsey-perfect if there is a constant <i>c</i> such that <span>(R(p,q)=(p-1)(q-1)+1)</span> for all <span>(p,qge c)</span> in this class. In the present paper, we identify a number of Ramsey-perfect classes which are not subclasses of perfect graphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Weak Dynamic Coloring of Planar Graphs 平面图的弱动态着色
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-24 DOI: 10.1007/s00373-023-02748-3
Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, Paul Wenger
{"title":"Weak Dynamic Coloring of Planar Graphs","authors":"Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, Paul Wenger","doi":"10.1007/s00373-023-02748-3","DOIUrl":"https://doi.org/10.1007/s00373-023-02748-3","url":null,"abstract":"<p>The <i>k</i>-<i>weak-dynamic number</i> of a graph <i>G</i> is the smallest number of colors we need to color the vertices of <i>G</i> in such a way that each vertex <i>v</i> of degree <i>d</i>(<i>v</i>) sees at least min<span>({k,d(v)})</span> colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results 边色完整图中的并行连接性：复杂性结果
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-10 DOI: 10.1007/s00373-023-02747-4
Rachid Saad
{"title":"Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results","authors":"Rachid Saad","doi":"10.1007/s00373-023-02747-4","DOIUrl":"https://doi.org/10.1007/s00373-023-02747-4","url":null,"abstract":"<p>Given an edge-colored graph <span>(G_c)</span>, a set of <i>p</i> pairs of vertices <span>((a_i,b_i))</span> together with <i>p</i> numbers <span>(k_1,k_2, ldots k_p)</span> associated with the pairs, can we find a set of alternating paths linking the pairs <span>((a_1,b_1))</span>, <span>((a_2,b_2), ldots )</span>, in their respective numbers <span>(k_1,k_2,ldots k_p)</span>? Such is the question addressed in this paper. The problem being highly intractable, we consider a restricted version of it to edge-colored complete graphs. Even so restricted, the problem remains intractable if the paths/trails must be edge-disjoint, but it ceases to be so if the paths/trails are to be vertex-disjoint, as is proved in this paper. An approximation algorithm is presented in the end, with a performance ratio asymptotically close to 3/4 for a restricted version of the problem.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Borodin–Kostochka Conjecture Holds for Odd-Hole-Free Graphs 无奇数孔图的鲍罗丁-科斯托奇卡猜想成立
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-10 DOI: 10.1007/s00373-024-02753-0
Rong Chen, Kaiyang Lan, Xinheng Lin, Yidong Zhou
{"title":"Borodin–Kostochka Conjecture Holds for Odd-Hole-Free Graphs","authors":"Rong Chen, Kaiyang Lan, Xinheng Lin, Yidong Zhou","doi":"10.1007/s00373-024-02753-0","DOIUrl":"https://doi.org/10.1007/s00373-024-02753-0","url":null,"abstract":"<p>The Borodin–Kostochka Conjecture states that for a graph <i>G</i>, if <span>(Delta (G)ge 9)</span>, then <span>(chi (G)le max {Delta (G)-1,omega (G)})</span>. In this paper, we prove the Borodin–Kostochka Conjecture holding for odd-hole-free graphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Inducing Degenerate Sums Through 2-Labellings 论通过二标注诱导退化和
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-09 DOI: 10.1007/s00373-024-02758-9
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
{"title":"On Inducing Degenerate Sums Through 2-Labellings","authors":"Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille","doi":"10.1007/s00373-024-02758-9","DOIUrl":"https://doi.org/10.1007/s00373-024-02758-9","url":null,"abstract":"<p>We deal with a variant of the 1–2–3 Conjecture introduced by Gao, Wang, and Wu (Graphs Combin 32:1415–1421, 2016) . This variant asks whether all graphs can have their edges labelled with 1 and 2 so that when computing the sums of labels incident to the vertices, no monochromatic cycle appears. In the aforementioned seminal work, the authors mainly verified their conjecture for a few classes of graphs, namely graphs with maximum average degree at most 3 and series–parallel graphs, and observed that it also holds for simple classes of graphs (cycles, complete graphs, and complete bipartite graphs). In this work, we provide a deeper study of this conjecture, establishing strong connections with other, more or less distant notions of graph theory. While this conjecture connects quite naturally to other notions and problems surrounding the 1–2–3 Conjecture, it can also be expressed so that it relates to notions such as the vertex-arboricity of graphs. Exploiting such connections, we provide easy proofs that the conjecture holds for bipartite graphs and 2-degenerate graphs, thus generalising some of the results of Gao, Wang, and Wu. We also prove that the conjecture holds for graphs with maximum average degree less than <span>(frac{10}{3})</span>, thereby strengthening another of their results. Notably, this also implies the conjecture holds for planar graphs with girth at least 5. All along the way, we also raise observations and results highlighting why the conjecture might be of greater interest.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Infinite Ramsey-Minimal Graphs for Star Forests 星形森林的无限拉姆齐最小图
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-09 DOI: 10.1007/s00373-024-02752-1
Fawwaz Fakhrurrozi Hadiputra, Valentino Vito
{"title":"Infinite Ramsey-Minimal Graphs for Star Forests","authors":"Fawwaz Fakhrurrozi Hadiputra, Valentino Vito","doi":"10.1007/s00373-024-02752-1","DOIUrl":"https://doi.org/10.1007/s00373-024-02752-1","url":null,"abstract":"<p>For graphs <i>F</i>, <i>G</i>, and <i>H</i>, we write <span>(F rightarrow (G,H))</span> if every red-blue coloring of the edges of <i>F</i> produces a red copy of <i>G</i> or a blue copy of <i>H</i>. The graph <i>F</i> is said to be (<i>G</i>, <i>H</i>)-minimal if it is subgraph-minimal with respect to this property. The characterization problem for Ramsey-minimal graphs is classically done for finite graphs. In 2021, Barrett and the second author generalized this problem to infinite graphs. They asked which pairs (<i>G</i>, <i>H</i>) admit a Ramsey-minimal graph and which ones do not. We show that any pair of star forests such that at least one of them involves an infinite-star component admits no Ramsey-minimal graph. Also, we construct a Ramsey-minimal graph for a finite star forest versus a subdivision graph. This paper builds upon the results of Burr et al. (Discrete Math 33:227–237, 1981) on Ramsey-minimal graphs for finite star forests.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multipermutations and Stirling Multipermutations 多重突变和斯特林多重突变
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-07 DOI: 10.1007/s00373-024-02751-2
Richard A. Brualdi, Geir Dahl
{"title":"Multipermutations and Stirling Multipermutations","authors":"Richard A. Brualdi, Geir Dahl","doi":"10.1007/s00373-024-02751-2","DOIUrl":"https://doi.org/10.1007/s00373-024-02751-2","url":null,"abstract":"<p>We consider multipermutations and a certain partial order, the weak Bruhat order, on this set. This generalizes the Bruhat order for permutations, and is defined in terms of containment of inversions. Different characterizations of this order are given. We also study special multipermutations called Stirling multipermutations and their properties.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lattice Path Bicircular Matroids 格子路径双圆 Matroids
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-02-07 DOI: 10.1007/s00373-023-02749-2
{"title":"Lattice Path Bicircular Matroids","authors":"","doi":"10.1007/s00373-023-02749-2","DOIUrl":"https://doi.org/10.1007/s00373-023-02749-2","url":null,"abstract":"<h3>Abstract</h3> <p>Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids significantly differ from bicircular matroids. Recently, it was proved that all cosimple lattice path matroids have positive double circuits, while it was shown that there is a large class of cosimple bicircular matroids with no positive double circuits. These observations support Bonin and de Miers’ claim. Finally, Sivaraman and Slilaty suggested studying the intersection of lattice path matroids and bicircular matroids as a possibly interesting research topic. In this work, we exhibit the excluded bicircular matroids for the class of lattice path matroids, and we propose a characterization of the graph family whose bicircular matroids are lattice path matroids. As an application of this characterization, we propose a geometric description of 2-connected lattice path bicircular matroids.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术官方微信