On subgraphs with degrees of prescribed residues in the random graph
On subgraphs with degrees of prescribed residues in the random graph
复制标题
在随机图中具有指定残基度的子图
DOI:
--
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Michael Krivelevich
中科院分区:
文献类型:
--
作者:
Asaf Ferber;Liam Hardiman;Michael Krivelevich
We show that with high probability the random graph Gn,1/2$$ {G}_{n,1/2} $$ has an induced subgraph of linear size, all of whose degrees are congruent to r(modq)$$ rkern0.3em left(operatorname{mod}kern0.3em q
ight) $$ for any fixed r$$ r $$ and q≥2$$ qge 2 $$ . More generally, the same is true for any fixed distribution of degrees modulo q$$ q $$ . Finally, we show that with high probability we can partition the vertices of Gn,1/2$$ {G}_{n,1/2} $$ into q+1$$ q+1 $$ parts of nearly equal size, each of which induces a subgraph all of whose degrees are congruent to r(modq)$$ rkern0.3em left(operatorname{mod}kern0.3em q
ight) $$ . Our results resolve affirmatively a conjecture of Scott, who addressed the case q=2$$ q=2 $$ .
影响因子:
1
作者:
Balister P
通讯作者:
Balister P