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

Graphs and Combinatorics最新文献

筛选
英文 中文
A Note on Internal Partitions: The 5-Regular Case and Beyond 关于内部分区的说明：5-常规案例及其他
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-23 DOI: 10.1007/s00373-024-02774-9
Pál Bärnkopf, Zoltán Lóránt Nagy, Zoltán Paulovics
{"title":"A Note on Internal Partitions: The 5-Regular Case and Beyond","authors":"Pál Bärnkopf, Zoltán Lóránt Nagy, Zoltán Paulovics","doi":"10.1007/s00373-024-02774-9","DOIUrl":"https://doi.org/10.1007/s00373-024-02774-9","url":null,"abstract":"<p>An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the other one. It has been shown that apart from finitely many counterexamples, every 3, 4 or 6-regular graph has an internal partition. In this note we focus on the 5-regular case and show that among the subgraphs of minimum degree at least 3 of 5-regular graphs, there are some which have small intersection. We also discuss the existence of internal partitions in some families of Cayley graphs, notably we determine all 5-regular Abelian Cayley graphs which do not have an internal partition.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140200397","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
Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs 来自德萨图、正则图和德萨图的自正交码
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-21 DOI: 10.1007/s00373-024-02763-y
Dean Crnković, Andrea Švob
{"title":"Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs","authors":"Dean Crnković, Andrea Švob","doi":"10.1007/s00373-024-02763-y","DOIUrl":"https://doi.org/10.1007/s00373-024-02763-y","url":null,"abstract":"<p>In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang and Feng. These constructions can also be applied to adjacency matrices of the mentioned graphs. Since a lot of constructions of Deza graphs, normally regular digraphs and Deza digraphs in the sense of Wang and Feng have been known, the methods presented in this paper give us a rich source of matrices that span self-orthogonal codes.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"25 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140200194","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
The Existence of a Path with Two Blocks in Digraphs 在数图中存在有两个块的路径
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-12 DOI: 10.1007/s00373-024-02759-8
Amine El Sahili, Maidoun Mortada, Sara Nasser
{"title":"The Existence of a Path with Two Blocks in Digraphs","authors":"Amine El Sahili, Maidoun Mortada, Sara Nasser","doi":"10.1007/s00373-024-02759-8","DOIUrl":"https://doi.org/10.1007/s00373-024-02759-8","url":null,"abstract":"<p>We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any <i>n</i>-chromatic digraph <i>D</i>, with <span>(nge 4)</span>, contains a path with two blocks of order <i>n</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"34 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140126444","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
A Note on the Gyárfás–Sumner Conjecture 关于 Gyárfás-Sumner 猜想的说明
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-08 DOI: 10.1007/s00373-024-02754-z
Tung Nguyen, Alex Scott, Paul Seymour
{"title":"A Note on the Gyárfás–Sumner Conjecture","authors":"Tung Nguyen, Alex Scott, Paul Seymour","doi":"10.1007/s00373-024-02754-z","DOIUrl":"https://doi.org/10.1007/s00373-024-02754-z","url":null,"abstract":"<p>The Gyárfás–Sumner conjecture says that for every tree <i>T</i> and every integer <span>(tge 1)</span>, if <i>G</i> is a graph with no clique of size <i>t</i> and with sufficiently large chromatic number, then <i>G</i> contains an induced subgraph isomorphic to <i>T</i>. This remains open, but we prove that under the same hypotheses, <i>G</i> contains a subgraph <i>H</i> isomorphic to <i>T</i> that is “path-induced”; that is, for some distinguished vertex <i>r</i>, every path of <i>H</i> with one end <i>r</i> is an induced path of <i>G</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"37 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140072224","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
The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs 图形连续长度的谱半径、最大平均度和周期
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-05 DOI: 10.1007/s00373-024-02761-0
Wenqian Zhang
{"title":"The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs","authors":"Wenqian Zhang","doi":"10.1007/s00373-024-02761-0","DOIUrl":"https://doi.org/10.1007/s00373-024-02761-0","url":null,"abstract":"<p>In this paper, we study the relationship between spectral radius and maximum average degree of graphs. By using this relationship and the previous technique of Li and Ning in (J Graph Theory 103:486–492, 2023), we prove that, for any given positive number <span>(varepsilon &lt;frac{1}{3})</span>, if <i>n</i> is a sufficiently large integer, then any graph <i>G</i> of order <i>n</i> with <span>(rho (G)&gt;sqrt{leftlfloor frac{n^{2}}{4}rightrfloor })</span> contains a cycle of length <i>t</i> for all integers <span>(tin [3,(frac{1}{3}-varepsilon )n])</span>, where <span>(rho (G))</span> is the spectral radius of <i>G</i>. This improves the result of Li and Ning (2023).</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"73 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045305","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 Restricted Intersections and the Sunflower Problem 关于受限交叉口和向日葵问题
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-03-04 DOI: 10.1007/s00373-024-02760-1
Jeremy Chizewer
{"title":"On Restricted Intersections and the Sunflower Problem","authors":"Jeremy Chizewer","doi":"10.1007/s00373-024-02760-1","DOIUrl":"https://doi.org/10.1007/s00373-024-02760-1","url":null,"abstract":"<p>A sunflower with <i>r</i> petals is a collection of <i>r</i> sets over a ground set <i>X</i> such that every element in <i>X</i> is in no set, every set, or exactly one set. Erdős and Rado [5] showed that a family of sets of size <i>n</i> contains a sunflower if there are more than <span>(n!(r-1)^n)</span> sets in the family. Alweiss et al. [1] and subsequently, Rao [7] and Bell et al. [2] improved this bound to <span>((O(r log n))^n)</span>. We study the case where the pairwise intersections of the set family are restricted. In particular, we improve the best known bound for set families when the size of the pairwise intersections of any two sets is in a set <i>L</i>. We also present a new bound for the special case when the set <i>L</i> is the nonnegative integers less than or equal to <i>d</i> using the techniques of Alweiss et al. [1].</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"47 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140025466","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
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":"30 1","pages":""},"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":"1 1","pages":""},"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":"183 1","pages":""},"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":"128 1","pages":""},"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
首页 上一页 下一页 尾页
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学术官方微信