Spanning subdivisions in Dirac graphs

IF 0.9 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Combinatorics, Probability & Computing Pub Date : 2023-10-20 DOI:10.1017/s0963548323000342

Matías Pavez-Signé

引用次数: 1

Abstract

Abstract We show that for every $n\in \mathbb N$ and $\log n\le d\lt n$ , if a graph $G$ has $N=\Theta (dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$ , then it contains a spanning subdivision of every $n$ -vertex $d$ -regular graph.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

在狄拉克图中生成细分

摘要我们证明了对于每一个$n\in \mathbb N$和$\log n\le d\lt n$，如果一个图$G$有$N=\Theta (dn)$个顶点和最小度$(1+o(1))\frac{N}{2}$，那么它包含了每一个$n$ -顶点$d$ -正则图的一个生成细分。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Combinatorics, Probability & Computing 数学-计算机：理论方法

CiteScore

2.40

自引率

11.10%

发文量

审稿时长

6-12 weeks

期刊介绍： Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

期刊最新文献

Spanning trees in graphs without large bipartite holes Approximate discrete entropy monotonicity for log-concave sums A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree Mastermind with a linear number of queries On oriented cycles in randomly perturbed digraphs