当前位置: X-MOL 学术J. Graph Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Erratum: The 2‐surviving rate of planar graphs with average degree lower than 9 2
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2021-03-12 , DOI: 10.1002/jgt.22663
Przemysław Gordinowicz 1
Affiliation  

In this note the correction to the proof of Theorem 1.2 from Gordinowicz and the corrected version of Corollary 1.4 is presented.

In [1] the firefighter problem on planar graphs was considered. In particular the following bound for the 2‐surviving rate (expected fraction of the vertices of a graph saved from the fire starting at a random vertex, provided that two vertices per round can be protected) was established.

Theorem 1.2.Let G be any connected planar graph with n 2 vertices and m edges. If for some ϵ ( 0 , 5 2 ] one has 2 m n = 9 2 ϵ , then

ρ 2 ( G ) 2 9 ε for ϵ 1 , 2 9 ε 1 n otherwise .

However, as pointed out by Bartosz Walczak, there was some technical/calculation error in the proof (the solution of an auxiliary parameterised linear program was partially incorrect) which caused a gap in the proof for graphs on less than 36 vertices. A complete, corrected proof is presented in Section 2. We note that Theorem 1.2 remains unchanged.

The theorem was followed by two corollaries and one of them also needs a correction. There was some miscalculation (again pointed out by Bartosz Walczak) in the bound for average degree for planar graphs without 4‐cycles. The proper value is 30 7 (one can either check it in, e.g., [3, Lemma 1.7] or derive it directly from Euler Formula) and it leads to the following.

Corollary 1.4. ((Corrected))Let G be any graph on at least two vertices. If G does not contain any 4‐cycle, then

ρ 2 ( G ) > 1 21 .

We refer the reader to the original paper for the definitions and notations used in this note. The numbering of theorems, lemmas and corollaries follows the numeration in [1].



中文翻译:

勘误:平均度低于9 2的平面图的2生存率

在本注释中,提出了对来自Gordinowicz的定理1.2证明的更正以及对推论1.4的更正。

在[ 1 ]中,考虑了平面图上的消防员问题。尤其要为2生存率(从火中保存的图形的顶点的期望分数,从一个随机顶点开始,假设每轮可以保护两个顶点)确定以下界限。

定理1.2。 G 与任何连接的平面图 ñ 2个 顶点和 边缘。如果有的话 ϵ 0 5 2个 ] 一个有 2个 ñ = 9 2个 - ϵ , 然后

ρ 2个 G 2个 9 ε 为了 ϵ 1个 2个 9 ε - 1个 ñ 除此以外

但是,正如Bartosz Walczak所指出的,证明中存在一些技术/计算错误(辅助参数化线性程序的解在某种程度上是不正确的),这导致了少于36个顶点的图形的证明存在空白。第2节中提供了完整的,经过更正的证明。我们注意到定理1.2保持不变。

该定理后面有两个推论,其中之一也需要更正。没有4个循环的平面图的平均度界有一些误算(由Bartosz Walczak再次指出)。正确的值是 30 7 (可以将其检入[ 3,引理1.7]或直接从Euler公式得出),然后得出以下结论。

推论1.4。((更正)) G 在至少两个顶点上为任意图。如果 G 不包含任何4个周期,则

ρ 2个 G > 1个 21岁

对于本注释中使用的定义和符号,我们请读者参考原始论文。定理,引理和推论的编号遵循[ 1 ]中的编号。

更新日期:2021-05-14
down
wechat
bug