图浸入式的分裂定理

IF 0.9 3区数学 Q1 MATHEMATICS

European Journal of Combinatorics Pub Date : 2025-08-02 DOI:10.1016/j.ejc.2025.104223

Matt DeVos, Mahdieh Malekian

引用次数: 0

摘要

我们建立了两个图族的图浸入的分裂定理，k边连通图，有k偶，3边连通图，内部4边连通图。作为推论，我们证明了每个3边连接，内部4边连接的图在至少7个顶点上，浸入K5也有k3,3作为浸入。

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

查看原文本刊更多论文

Splitter theorems for graph immersions

We establish splitter theorems for graph immersions for two families of graphs,

k

-edge-connected graphs, with

k

even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every 3-edge-connected, internally 4-edge-connected graph on at least seven vertices that immerses

K_{5}

also has

K_{3, 3}

as an immersion.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

European Journal of Combinatorics 数学-数学

CiteScore

2.10

自引率

10.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.