3-统一超图中的匹配理论新进展
164 浏览量
更新于2024-07-14
收藏 271KB PDF 举报
"Matchings in 3-uniform Hypergraphs (2012)-计算机科学"
这篇学术文章发表在《组合论理论杂志，系列B》2013年第103期，291-305页，作者是Daniela Kühn、Deryk Osthus和Andrew Treglown，分别来自英国伯明翰大学和伦敦玛丽女王大学的数学学院。该研究主要探讨了3-统一超图中的匹配问题，这是一个在组合优化和图论领域的重要课题。
在图论中，匹配是指一个边集，其中任意两条边不共享公共顶点。而在超图中，这个概念被扩展到“超边”，即连接三个或更多顶点的边。3-统一超图是指每条超边都连接着3个顶点的超图。这篇文章的核心内容是确定确保3-统一超图存在完美匹配的最小顶点度数条件。
作者们证明了一个关键结果：如果一个3-统一超图H的阶数（即它包含的顶点数）n是3的倍数，并且其最小顶点度大于`(n-1)/2 - (2n/3)^{1/2}`，那么H必定包含一个完美匹配。这个结果是对之前由Hàn, Person和Schacht提出问题的解答，表明这个阈值是最佳可能的。此外，他们还展示了一个更一般性的结论：如果H的最小顶点度大于`(n-1)/2 - (n-d)^{1/2}`，那么H至少包含一个大小不超过n/3的匹配。这个结果同样具有最优性。
文章的接收日期为2010年8月16日，最终在线发布于2012年12月1日。关键词包括“完美匹配”、“超图”等，这些标签反映了研究的核心主题。该研究成果对理解超图的结构特性，特别是在寻找匹配和度条件方面提供了重要的理论基础，对于算法设计和复杂性理论等领域具有深远影响。
D. Kühn et al. / Journal of Combinatorial Theory, Series B 103 (2013) 291–305 293
Theorem 4. There exists an n
0
∈ N such that the following holds. Suppose that H is a 3-uniform hypergraph
on n
n
0
vertices, that n/3 d ∈ N and that
δ
1
(H)>
n − 1
2
−
n −d
2
.
Then H contains a matching of size at least d.
It would be interesting to obtain analogous results (i.e. minimum degree conditions which guar-
antee a matching of size d)forr-uniform hypergraphs and for r-partite hypergraphs. Some bounds
are given in [5]. Further, a 3-partite version of Theorem 1 was recently proved by Lo and Mark-
ström [12].
Treglown and Zhao [18,19] determined the minimum
-degree that ensures a perfect matching
in an r-uniform hypergraph when r
/2 r − 1. (Independently, Czygrinow and Kamat [4] dealt
with the case when r
= 4 and = 2.) Prior to this, Pikhurko [14] gave an asymptotically exact result.
The situation for
-degrees where 1 <<r/2isstillopen.In[6], Hàn, Person and Schacht provided
conditions on
δ
(H) that ensure a perfect matching in the case when <r/2. These bounds were
subsequently lowered by Markström and Ruci
´
nski [13]. Alon, Frankl, Huang, Rödl, Ruci
´
nski and Su-
dakov [2] discovered a connection between the minimum
-degree that forces a perfect matching
in an r-uniform hypergraph and the minimum
-degree that forces a perfect fractional matching.As
a consequence of this result they determined, asymptotically, the minimum
-degree that ensures a
perfect matching in an r-uniform hypergraph for the following values of
(r,): (4, 1), (5, 1), (5, 2),
(6, 2) and (7, 3). See [15] for further results concerning perfect matchings in hypergraphs.
2. Notation
Given a hypergraph H and subsets V
1
, V
2
, V
3
of its vertex set V (H), we say that an edge v
1
v
2
v
3
is of type V
1
V
2
V
3
if v
1
∈ V
1
, v
2
∈ V
2
and v
3
∈ V
3
.
Let d
n/3 and let V , W be a partition of a set of n vertices such that |W |=d.DefineH
n,d
(V , W )
tobethehypergraphwithvertexsetV ∪ W consisting of all those edges which have type VVW or
VWW.ThusH
n,d
(V , W ) has a matching of size d,
δ
1
H
n,d
(V , W )
=
n − 1
2
−
n −d − 1
2
and H
n,d
(V , W ) is very close to the extremal hypergraph which shows that the degree condition in
Theorem 4 is best possible. V and W are the vertex classes of H
n,d
(V , W ).
Given
ε > 0, a 3-uniform hypergraph H on n vertices and a partition V , W of V (H) with |W |=d,
we say that H is
ε-close to H
n,d
(V , W ) if
E
H
n,d
(V , W )
\ E(H)
εn
3
.
In this case we also call V and W vertex classes of H.(SoH does not have unique vertex classes.) We
say that H is
ε-close to H
n,d
if there is a partition V , W of V (H) such that |W |=d and H is ε-close
to H
n,d
(V , W ).
Given a vertex v of a 3-uniform hypergraph H ,wewriteN
H
(v) for the neighbourhood of v,i.e.
the set of all those (unordered) tuples of vertices which form an edge together with v.Giventwo
disjoint sets A
, B ⊆ V (H),wedefinethelink graph L
v
(A, B) of v with respect to A, B to be the bipartite
graph whose vertex classes are A and B and in which a
∈ A is joined to b ∈ B if and only if ab ∈
N
H
(v). Similarly, given a set A ⊆ V (H),wedefinethelink graph L
v
(A) of v with respect to A to be the
graph whose vertex set is A and in which a
, a
∈ A are joined if and only if aa
∈ N
H
(v). Also, given
disjoint sets A
, B, C , D, E ⊆ V (H),wewriteL
v
(ABCD) for L
v
(A, B) ∪ L
v
(B, C) ∪ L
v
(C, D).Wedefine
L
v
(ABCDE) similarly. If M is a matching in H and E, F are two edges in M with v /∈ E, F ,wewrite
L
v
(EF) for L
v
(V (E), V (F )).IfE
1
,...,E
5
are matching edges avoiding v,wedefineL
v
(E
1
...E
4
) and
L
v
(E
1
...E
5
) similarly. If e = uw is an edge in the link graph of v,thenwewriteve for the edge
vuw of H. A matching in H of size d is called a d-matching.
剩余14页未读，继续阅读
2021-04-22 上传
2021-04-22 上传
2021-04-22 上传
2021-04-22 上传
2021-04-22 上传
2021-04-22 上传
点击了解资源详情
2024-11-07 上传
weixin_38658405
- 粉丝: 4
- 资源: 1010
我的内容管理
展开
最新资源
- 探索数据转换实验平台在设备装置中的应用
- 使用git-log-to-tikz.py将Git日志转换为TIKZ图形
- 小栗子源码2.9.3版本发布
- 使用Tinder-Hack-Client实现Tinder API交互
- Android Studio新模板：个性化Material Design导航抽屉
- React API分页模块：数据获取与页面管理
- C语言实现顺序表的动态分配方法
- 光催化分解水产氢固溶体催化剂制备技术揭秘
- VS2013环境下tinyxml库的32位与64位编译指南
- 网易云歌词情感分析系统实现与架构
- React应用展示GitHub用户详细信息及项目分析
- LayUI2.1.6帮助文档API功能详解
- 全栈开发实现的chatgpt应用可打包小程序/H5/App
- C++实现顺序表的动态内存分配技术
- Java制作水果格斗游戏：策略与随机性的结合
- 基于若依框架的后台管理系统开发实例解析
