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

SIAM Journal on Discrete Mathematics最新文献

筛选
英文 中文
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures 用单调路径和其他结构平铺边缘有序图
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-06-07 DOI: 10.1137/23m1572519
Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang
{"title":"Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures","authors":"Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang","doi":"10.1137/23m1572519","DOIUrl":"https://doi.org/10.1137/23m1572519","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1808-1839, June 2024. <br/> Abstract. Given graphs [math] and [math], a perfect [math]-tiling in [math] is a collection of vertex-disjoint copies of [math] in [math] that together cover all the vertices in [math]. The study of the minimum degree threshold forcing a perfect [math]-tiling in a graph [math] has a long history, culminating in the Kühn–Osthus theorem [D. Kühn and D. Osthus, Combinatorica, 29 (2009), pp. 65–107] which resolves this problem, up to an additive constant, for all graphs [math]. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs [math] this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect [math]-tiling in an edge-ordered graph, where [math] is any fixed monotone path.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"16 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529751","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
Brillouin Zones of Integer Lattices and Their Perturbations 整数网格的布里渊区及其扰动
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-06-07 DOI: 10.1137/22m1489071
Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken
{"title":"Brillouin Zones of Integer Lattices and Their Perturbations","authors":"Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken","doi":"10.1137/22m1489071","DOIUrl":"https://doi.org/10.1137/22m1489071","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1784-1807, June 2024. <br/> Abstract. For a locally finite set, [math], the [math]th Brillouin zone of [math] is the region of points [math] for which [math] is the [math]th smallest among the Euclidean distances between [math] and the points in [math]. If [math] is a lattice, the [math]th Brillouin zones of the points in [math] are translates of each other, and together they tile space. Depending on the value of [math], they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in [math], and the convergence of the maximum volume of a chamber to zero for the integer lattice.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"13 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141526707","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
Tuza’s Conjecture for Binary Geometries 二元几何的图扎猜想
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-30 DOI: 10.1137/22m1511229
Kazuhiro Nomoto, Jorn van der Pol
{"title":"Tuza’s Conjecture for Binary Geometries","authors":"Kazuhiro Nomoto, Jorn van der Pol","doi":"10.1137/22m1511229","DOIUrl":"https://doi.org/10.1137/22m1511229","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1676-1685, June 2024. <br/> Abstract. Tuza [Finite and Infinite Sets, Proc. Colloq. Math. Soc. János Bolyai 37, North Holland, 1981, p. 888] conjectured that [math] for all graphs [math], where [math] is the minimum size of an edge set whose removal makes [math] triangle-free and [math] is the maximum size of a collection of pairwise edge-disjoint triangles. Here, we generalize Tuza’s conjecture to simple binary matroids that do not contain the Fano plane as a restriction and prove that the geometric version of the conjecture holds for cographic matroids.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"71 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141173347","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
Topology of Cut Complexes of Graphs 图形切割复合物拓扑学
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-24 DOI: 10.1137/23m1569034
Margaret Bayer, Mark Denker, Marija Jelić Milutinović, Rowan Rowlands, Sheila Sundaram, Lei Xue
{"title":"Topology of Cut Complexes of Graphs","authors":"Margaret Bayer, Mark Denker, Marija Jelić Milutinović, Rowan Rowlands, Sheila Sundaram, Lei Xue","doi":"10.1137/23m1569034","DOIUrl":"https://doi.org/10.1137/23m1569034","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1630-1675, June 2024. <br/>Abstract. We define the [math]-cut complex of a graph [math] with vertex set [math] to be the simplicial complex whose facets are the complements of sets of size [math] in [math] inducing disconnected subgraphs of [math]. This generalizes the Alexander dual of a graph complex studied by Fröberg [Topics in Algebra, Part 2, PWN, Warsaw, 1990, pp. 57–70] and Eagon and Reiner [J. Pure Appl. Algebra, 130 (1998), pp. 265–275]. We describe the effect of various graph operations on the cut complex and study its shellability, homotopy type, and homology for various families of graphs, including trees, cycles, complete multipartite graphs, and the prism [math], using techniques from algebraic topology, discrete Morse theory, and equivariant poset topology.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"22 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146393","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
Left-Cut-Percolation and Induced-Sidorenko Bigraphs 左切-珀切和诱导-西多伦科大图
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-23 DOI: 10.1137/22m1526794
Leonardo N. Coregliano
{"title":"Left-Cut-Percolation and Induced-Sidorenko Bigraphs","authors":"Leonardo N. Coregliano","doi":"10.1137/22m1526794","DOIUrl":"https://doi.org/10.1137/22m1526794","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1586-1629, June 2024. <br/> Abstract. A Sidorenko bigraph is one whose density in a bigraphon [math] is minimized precisely when [math] is constant. Several techniques in the literature to prove the Sidorenko property consist of decomposing (typically in a tree decomposition) the bigraph into smaller building blocks with stronger properties. One prominent such technique is that of [math]-decompositions of Conlon and Lee, which uses weakly Hölder (or weakly norming) bigraphs as building blocks. In turn, to obtain weakly Hölder bigraphs, it is typical to use the chain of implications reflection bigraph [math] cut-percolating bigraph [math] weakly Hölder bigraph. In an earlier result by the author with Razborov, we provided a generalization of [math]-decompositions, called reflective tree decompositions, that uses much weaker building blocks, called induced-Sidorenko bigraphs, to also obtain Sidorenko bigraphs. In this paper, we show that “left-sided” versions of the concepts of reflection bigraph and cut-percolating bigraph yield a similar chain of implications: left-reflection bigraph [math] left-cut-percolating bigraph [math] induced-Sidorenko bigraph. We also show that under mild hypotheses the “left-sided” analogue of the weakly Hölder property (which is also obtained via a similar chain of implications) can be used to improve bounds on another result of Conlon and Lee that roughly says that bigraphs with enough vertices on the right side of each realized degree have the Sidorenko property.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"29 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153959","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
Bounding and Computing Obstacle Numbers of Graphs 图形的边界和障碍数计算
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-20 DOI: 10.1137/23m1585088
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
{"title":"Bounding and Computing Obstacle Numbers of Graphs","authors":"Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff","doi":"10.1137/23m1585088","DOIUrl":"https://doi.org/10.1137/23m1585088","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1537-1565, June 2024. <br/> Abstract. An obstacle representation of a graph [math] consists of a set of pairwise disjoint simply connected closed regions and a one-to-one mapping of the vertices of [math] to points such that two vertices are adjacent in [math] if and only if the line segment connecting the two corresponding points does not intersect any obstacle. The obstacle number of a graph is the smallest number of obstacles in an obstacle representation of the graph in the plane such that all obstacles are simple polygons. It is known that the obstacle number of each [math]-vertex graph is [math] [M. Balko, J. Cibulka, and P. Valtr, Discrete Comput. Geom., 59 (2018), pp. 143–164] and that there are [math]-vertex graphs whose obstacle number is [math] [V. Dujmović and P. Morin, Electron. J. Combin., 22 (2015), 3.1]. We improve this lower bound to [math] for simple polygons and to [math] for convex polygons. To obtain these stronger bounds, we improve known estimates on the number of [math]-vertex graphs with bounded obstacle number, solving a conjecture by Dujmović and Morin. We also show that if the drawing of some [math]-vertex graph is given as part of the input, then for some drawings [math] obstacles are required to turn them into an obstacle representation of the graph. Our bounds are asymptotically tight in several instances. We complement these combinatorial bounds by two complexity results. First, we show that computing the obstacle number of a graph [math] is fixed-parameter tractable in the vertex cover number of [math]. Second, we show that, given a graph [math] and a simple polygon [math], it is NP-hard to decide whether [math] admits an obstacle representation using [math] as the only obstacle.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"48 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146395","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 Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models 作为条件独立性模型的矩阵和定向矩阵的公理化
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-17 DOI: 10.1137/23m1558653
Xiangying Chen
{"title":"An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models","authors":"Xiangying Chen","doi":"10.1137/23m1558653","DOIUrl":"https://doi.org/10.1137/23m1558653","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1526-1536, June 2024. <br/> Abstract. Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence from linear independence, deep connections between these two areas are found and are still undergoing active research. In this paper, we give a characterization of the embedding of matroids into conditional independence structures and its oriented counterpart, which leads to new axiom systems of matroids and oriented matroids.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"43 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141062659","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 Simple Path to Component Sizes in Critical Random Graphs 临界随机图中组件大小的简单路径
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-07 DOI: 10.1137/22m151056x
Umberto De Ambroggio
{"title":"A Simple Path to Component Sizes in Critical Random Graphs","authors":"Umberto De Ambroggio","doi":"10.1137/22m151056x","DOIUrl":"https://doi.org/10.1137/22m151056x","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1492-1525, June 2024. <br/> Abstract. We describe a robust methodology, based on the martingale argument of Nachmias and Peres and random walk estimates, to obtain simple upper and lower bounds on the size of a maximal component in several random graphs at criticality. Even though the main result is not new, we believe the material presented here is interesting because it unifies several proofs found in the literature into a common framework. More specifically, we give easy-to-check conditions that, when satisfied, allow an immediate derivation of the above-mentioned bounds.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"37 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889887","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 Maximal Running Time of Hypergraph Bootstrap Percolation 超图引导循环的最大运行时间
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-07 DOI: 10.1137/22m151995x
Ivailo Hartarsky, Lyuben Lichev
{"title":"The Maximal Running Time of Hypergraph Bootstrap Percolation","authors":"Ivailo Hartarsky, Lyuben Lichev","doi":"10.1137/22m151995x","DOIUrl":"https://doi.org/10.1137/22m151995x","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1462-1471, June 2024. <br/> Abstract. We show that for every [math], the maximal running time of the [math]-bootstrap percolation in the complete [math]-uniform hypergraph on [math] vertices [math] is [math]. This answers a recent question of Noel and Ranganathan in the affirmative and disproves a conjecture of theirs. Moreover, we show that the prefactor is of the form [math] as [math].","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"32 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140883085","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
Rainbow Bases in Matroids 矩阵中的彩虹基
IF 0.8 3区 数学
SIAM Journal on Discrete Mathematics Pub Date : 2024-05-07 DOI: 10.1137/22m1516750
Florian Hörsch, Tomáš Kaiser, Matthias Kriesell
{"title":"Rainbow Bases in Matroids","authors":"Florian Hörsch, Tomáš Kaiser, Matthias Kriesell","doi":"10.1137/22m1516750","DOIUrl":"https://doi.org/10.1137/22m1516750","url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1472-1491, June 2024. <br/> Abstract. Recently, it was proved by Bérczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were left open. We first show that the problem remains hard if the matroid is graphic, answering a question of Bérczi and Schwarcz. As another special case, we consider the problem of deciding whether a given digraph can be factorized into subgraphs which are spanning trees in the underlying sense and respect upper bounds on the indegree of every vertex. We prove that this problem is also hard. This answers a question of Frank. In the second part of the article, we deal with the relaxed problem of covering the ground set of a matroid by rainbow bases. Among other results, we show that there is a linear function [math] such that every matroid that can be factorized into [math] bases for some [math] can be covered by [math] rainbow bases if every partition class contains at most 2 elements.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"41 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140883083","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学术官方微信