arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.04299math.CO
收藏

极大边连通实现与 Kundu 的 $k$-因子定理

Maximally Edge-Connected Realizations and Kundu's $k$-factor Theorem

James M. Shook

AI总结:

本文加强 Edmonds 关于度序列边连通实现的定理,刻画可保留给定子图且改动边数受限的极大边连通实现,并结合 Kundu 的 $k$-因子定理得到带因子实现的新结果。

摘要:

一个具有边连通度 $λ(G)$ 和最小度 $δ(G)$ 的简单图 $G$,若 $λ(G)=δ(G)$,则称为极大边连通图。1964 年,对于给定的非递增度序列 $π=(d_{1},\ldots,d_{n})$,Jack Edmonds 证明:$π$ 存在一个 $k$-边连通的实现 $G$,当且仅当 $d_{n}\geq k$,并且当 $d_{n}=1$ 时满足 $\sum_{i=1}^{n}d_{i}\geq 2(n-1)$。我们加强了 Edmonds 的结果,证明:给定 $π$ 的一个实现 $G_{0}$,如果 $Z_{0}$ 是 $G_{0}$ 的一个生成子图,满足 $δ(Z_{0})\geq 1$,且在 $δ(G_{0})=1$ 时有 $|E(Z_{0})|\geq n-1$,那么 $π$ 存在一个极大边连通实现,并以 $G_{0}-E(Z_{0})$ 为子图。我们的定理表明,存在一个与 $G_{0}$ 至多相差 $n-1$ 条边的极大边连通实现。对于 $δ(G_{0})\geq 2$,如果 $G_{0}$ 具有一个含 $c$ 个连通分量的生成森林,那么定理表明存在一个极大边连通实现,与 $G_{0}$ 至多相差 $n-c$ 条边。作为应用,我们将该工作与 Kundu 的 $k$-因子定理结合,证明在 $k\leq k_{i}\leq k+1$ 时存在一个具有 $(k_{1},\dots,k_{n})$-因子的极大边连通实现,并针对加强 Kundu 的 $k$-因子定理正则情形的一个猜想给出了部分结果。

英文摘要:

A simple graph $G$ with edge-connectivity $λ(G)$ and minimum degree $δ(G)$ is maximally edge connected if $λ(G)=δ(G)$. In 1964, given a non-increasing degree sequence $π=(d_{1},\ldots,d_{n})$, Jack Edmonds showed that there is a realization $G$ of $π$ that is $k$-edge-connected if and only if $d_{n}\geq k$ with $\sum_{i=1}^{n}d_{i}\geq 2(n-1)$ when $d_{n}=1$. We strengthen Edmonds's result by showing that given a realization $G_{0}$ of $π$ if $Z_{0}$ is a spanning subgraph of $G_{0}$ with $δ(Z_{0})\geq 1$ such that $|E(Z_{0})|\geq n-1$ when $δ(G_{0})=1$, then there is a maximally edge-connected realization of $π$ with $G_{0}-E(Z_{0})$ as a subgraph. Our theorem tells us that there is a maximally edge-connected realization of $π$ that differs from $G_{0}$ by at most $n-1$ edges. For $δ(G_{0})\geq 2$, if $G_{0}$ has a spanning forest with $c$ components, then our theorem says there is a maximally edge-connected realization that differs from $G_{0}$ by at most $n-c$ edges. As an application we combine our work with Kundu's $k$-factor Theorem to show there is a maximally edge-connected realization with a $(k_{1},\dots,k_{n})$-factor for $k\leq k_{i}\leq k+1$ and present a partial result to a conjecture that strengthens the regular case of Kundu's $k$-factor theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑