SIAM J. Discret. Math.最新文献_第6页

A $frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case 半积分情况下最小2边连通多子图问题的近似算法

SIAM J. Discret. Math. Pub Date : 2022-07-28 DOI: 10.1137/20m1372822

Sylvia C. Boyd, J. Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Z. Szigeti, Lu Wang

引用次数: 1

Results on the Small Quasi-Kernel Conjecture 关于小拟核猜想的结果

SIAM J. Discret. Math. Pub Date : 2022-07-25 DOI: 10.48550/arXiv.2207.12157

J. Ai, S. Gerke, G. Gutin, Anders Yeo, Yacong Zhou

引用次数: 2

Constructions of linear codes with two or three weights from vectorial dual-bent functions 由向量双弯曲函数构造两个或三个权值的线性码

SIAM J. Discret. Math. Pub Date : 2022-07-24 DOI: 10.48550/arXiv.2207.11668

Jiaxin Wang, Zexia Shi, Yadi Wei, Fang-Wei Fu

引用次数: 1

Jacobi polynomials and design theory I 雅可比多项式与设计理论1

SIAM J. Discret. Math. Pub Date : 2022-07-22 DOI: 10.48550/arXiv.2207.10911

H. Chakraborty, T. Miezaki, M. Oura, Yuuho Tanaka

引用次数: 3

A General Framework for Hypergraph Coloring 超图着色的一般框架

SIAM J. Discret. Math. Pub Date : 2022-07-14 DOI: 10.1137/21m1421015

Ian M. Wanless, D. Wood

引用次数: 18

Planar Convex Codes are Decidable 平面凸码是可判定的

SIAM J. Discret. Math. Pub Date : 2022-07-13 DOI: 10.1137/22m1511187

B. Bukh, R. Jeffs

引用次数: 3

On the Size of Matchings in 1-Planar Graph with High Minimum Degree 高最小度1-平面图中匹配的大小问题

SIAM J. Discret. Math. Pub Date : 2022-07-08 DOI: 10.1137/21m1459952

Yuanqiu Huang, Zhangdong Ouyang, F. Dong

引用次数: 1

Posets and Spaces of $k$-Noncrossing RNA Structures $k$-非交叉RNA结构的序集和空间

SIAM J. Discret. Math. Pub Date : 2022-07-07 DOI: 10.1137/21m1413316

V. Moulton, Taoyang Wu

引用次数: 0

Many Cliques in Bounded-Degree Hypergraphs 有界度超图中的许多团

SIAM J. Discret. Math. Pub Date : 2022-07-05 DOI: 10.1137/22m1507565

R. Kirsch, Jamie Radcliffe

{"title":"Many Cliques in Bounded-Degree Hypergraphs","authors":"R. Kirsch, Jamie Radcliffe","doi":"10.1137/22m1507565","DOIUrl":"https://doi.org/10.1137/22m1507565","url":null,"abstract":"Recently Chase determined the maximum possible number of cliques of size $t$ in a graph on $n$ vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the version of this question in which we ask that the graph have $m$ edges and fixed maximum degree (without imposing any constraint on the number of vertices). In this paper we address these problems on hypergraphs. For $s$-graphs with $sge 3$ a number of issues arise that do not appear in the graph case. For instance, for general $s$-graphs we can assign degrees to any $i$-subset of the vertex set with $1le ile s-1$. We establish bounds on the number of $t$-cliques in an $s$-graph $mathcal{H}$ with $i$-degree bounded by $Delta$ in three contexts: $mathcal{H}$ has $n$ vertices; $mathcal{H}$ has $m$ (hyper)edges; and (generalizing the previous case) $mathcal{H}$ has a fixed number $p$ of $u$-cliques for some $u$ with $sle u le t$. When $Delta$ is of a special form we characterize the extremal $s$-graphs and prove that the bounds are tight. These extremal examples are the shadows of either Steiner systems or packings. On the way to proving our uniqueness results, we extend results of F\"uredi and Griggs on uniqueness in Kruskal-Katona from the shadow case to the clique case.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78636224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters 由反馈顶点集和其他结构参数参数化度量维度

SIAM J. Discret. Math. Pub Date : 2022-06-30 DOI: 10.48550/arXiv.2206.15424

Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, P. Tale

{"title":"Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters","authors":"Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, P. Tale","doi":"10.48550/arXiv.2206.15424","DOIUrl":"https://doi.org/10.48550/arXiv.2206.15424","url":null,"abstract":"For a graph $G$, a subset $S subseteq V(G)$ is called a emph{resolving set} if for any two vertices $u,v in V(G)$, there exists a vertex $w in S$ such that $d(w,u) neq d(w,v)$. The {sc Metric Dimension} problem takes as input a graph $G$ and a positive integer $k$, and asks whether there exists a resolving set of size at most $k$. This problem was introduced in the 1970s and is known to be NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the problem is W[2]-hard when parameterized by the natural parameter $k$. They also observed that it is FPT when parameterized by the vertex cover number and asked about its complexity under emph{smaller} parameters, in particular the feedback vertex set number. We answer this question by proving that {sc Metric Dimension} is W[1]-hard when parameterized by the combined parameter feedback vertex set number plus pathwidth. This also improves the result of Bonnet and Purohit~[IPEC 2019] which states that the problem is W[1]-hard parameterized by the pathwidth. On the positive side, we show that {sc Metric Dimension} is FPT when parameterized by either the distance to cluster or the distance to co-cluster, both of which are smaller parameters than the vertex cover number.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84091485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1