CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
무지개 집합 문제에서의 위상수학적 조합론
Authors
김진하
Publication date
1 August 2019
Publisher
서울대학교 대학원
Abstract
학위논문(박사)--서울대학교 대학원 :자연과학대학 수리과학부,2019. 8. 국웅.
F
=
{
S
1
,
…
,
S
m
}
\mathcal{F}=\{S_1,\ldots,S_m\}
F
=
{
S
1
,
…
,
S
m
}
를
V
V
V
의 공집합이 아닌 부분 집합들의 모임이라 할 때,
F
\mathcal{F}
F
의 무지개 집합이란 공집합이 아니며
S
=
{
s
i
1
,
…
,
s
i
k
}
⊂
V
S=\{s_{i_1},\ldots,s_{i_k}\} \subset V
S
=
{
s
i
1
,
…
,
s
i
k
}
⊂
V
와 같은 형태로 주어지는 것으로 다음 조건을 만족하는 것을 말한다.
1
≤
i
1
<
⋯
<
i
k
≤
m
1\leq i_1<\cdots<i_k \leq m
1
≤
i
1
<
⋯
<
i
k
≤
m
이고
j
≠
j
j \ne j
j
=
j
이면
s
i
j
≠
s
i
j
′
s_{i_j} \ne s_{i_j'}
s
i
j
=
s
i
j
′
를 만족하며 각
j
∈
[
m
]
j \in [m]
j
∈
[
m
]
에 대해
s
i
j
∈
S
i
j
s_{i_j} \in S_{i_j}
s
i
j
∈
S
i
j
이다. 특히
k
=
m
k=m
k
=
m
인 경우, 즉 모든
S
i
S_i
S
i
들이 표현되면, 무지개 집합
S
S
S
를
F
\mathcal{F}
F
의 완전 무지개 집합이라고 한다. 주어진 집합계가 특정 조건을 만족하는 무지개 집합을 가지기 위한 충분 조건을 찾는 문제는 홀의 결혼 정리에서 시작되어 최근까지도 조합수학에서 가장 대표적 문제 중 하나로 여겨져왔다. 이러한 방향으로의 문제를 무지개 집합 문제라고 부른다. 본 학위논문에서는 무지개 집합 문제와 관련하여 위상수학적 홀의 정리와 위상수학적 다색 헬리 정리를 소개하고, (하이퍼)그래프에서의 무지개 덮개와 무지개 독립 집합에 관한 결과들을 다루고자 한다.Let
F
=
{
S
1
,
…
,
S
m
}
\mathcal{F}=\{S_1,\ldots,S_m\}
F
=
{
S
1
,
…
,
S
m
}
be a finite family of non-empty subsets on the ground set
V
V
V
. A rainbow set of
F
\mathcal{F}
F
is a non-empty set of the form
S
=
{
s
i
1
,
…
,
s
i
k
}
⊂
V
S=\{s_{i_1},\ldots,s_{i_k}\} \subset V
S
=
{
s
i
1
,
…
,
s
i
k
}
⊂
V
with
1
≤
i
1
<
⋯
<
i
k
≤
m
1 \leq i_1 < \cdots < i_k \leq m
1
≤
i
1
<
⋯
<
i
k
≤
m
such that
s
i
j
≠
s
i
j
′
s_{i_j} \neq s_{i_{j'}}
s
i
j
=
s
i
j
′
for every
j
≠
j
′
j \neq j'
j
=
j
′
and
s
i
j
∈
S
i
j
s_{i_j} \in S_{i_j}
s
i
j
∈
S
i
j
for each
j
∈
[
k
]
j \in [k]
j
∈
[
k
]
. If
k
=
m
k = m
k
=
m
, namely if all
S
i
S_i
S
i
is represented, then the rainbow set
S
S
S
is called a full rainbow set of
F
\mathcal{F}
F
. Originated from the celebrated Hall's marriage theorem, it has been one of the most fundamental questions in combinatorics and discrete mathematics to find sufficient conditions on set-systems to guarantee the existence of certain rainbow sets. We call problems in this direction the rainbow set problems. In this dissertation, we give an overview on two topological tools on rainbow set problems, Aharoni and Haxell's topological Hall theorem and Kalai and Meshulam's topological colorful Helly theorem, and present some results on and rainbow independent sets and rainbow covers in (hyper)graphs.Abstract i 1 Introduction 1 1.1 Topological Hall theorem . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Topological colorful Helly theorem . . . . . . . . . . . . . . . . . 3 1.2.1 Collapsibility and Lerayness of simplicial complexes . . . 4 1.2.2 Nerve theorem and topological Helly theorem . . . . . . . 5 1.2.3 Topological colorful Helly theorem . . . . . . . . . . . . 6 1.3 Domination numbers and non-cover complexes of hypergraphs . . 7 1.3.1 Domination numbers of hypergraphs . . . . . . . . . . . . 10 1.3.2 Non-cover complexes of hypergraphs . . . . . . . . . . . . 10 1.4 Rainbow independent sets in graphs . . . . . . . . . . . . . . . . 12 1.5 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2 Collapsibility of non-cover complexes of graphs 16 2.1 The minimal exclusion sequences . . . . . . . . . . . . . . . . . . 16 2.2 Independent domination numbers and collapsibility numbers of non-cover complexes of graphs . . . . . . . . . . . . . . . . . . . 21 3 Domination numbers and non-cover complexes of hypergraphs 24 3.1 Proof of Theorem 1.3.4 . . . . . . . . . . . . . . . . . . . . . . . 25 3.1.1 Edge-annihilation . . . . . . . . . . . . . . . . . . . . . . 25 3.1.2 Non-cover complexes for hypergraphs . . . . . . . . . . . 27 3.2 Lerayness of non-cover complexes . . . . . . . . . . . . . . . . . 30 3.2.1 Total domination numbers . . . . . . . . . . . . . . . . . 30 3.2.2 Independent domination numbers . . . . . . . . . . . . . 33 3.2.3 Edgewise-domination numbers . . . . . . . . . . . . . . . 34 3.3 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 3.3.1 Independent domination numbers of hypergraphs . . . . . 35 3.3.2 Independence complexes of hypergraphs . . . . . . . . . . 36 3.3.3 General position complexes . . . . . . . . . . . . . . . . . 37 3.3.4 Rainbow covers of hypergraphs . . . . . . . . . . . . . . 39 3.3.5 Collapsibility of non-cover complexes of hypergraphs . . . 40 4 Rainbow independent sets 42 4.1 Graphs avoiding certain induced subgraphs . . . . . . . . . . . . 42 4.1.1 Claw-free graphs . . . . . . . . . . . . . . . . . . . . . . 42 4.1.2
{
C
4
,
C
5
,
.
.
.
,
C
s
}
\{C_4,C_5, . . . ,C_s\}
{
C
4
,
C
5
,
...
,
C
s
}
-free graphs . . . . . . . . . . . . . . . . . 44 4.1.3 Chordal graphs . . . . . . . . . . . . . . . . . . . . . . . 49 4.1.4
K
r
K_r
K
r
-free graphs and
K
r
−
K^{−}_r
K
r
−
-free graphs . . . . . . . . . . . . . 50 4.2
k
k
k
-colourable graphs . . . . . . . . . . . . . . . . . . . . . . . . . 54 4.3 Graphs with bounded degrees . . . . . . . . . . . . . . . . . . . . 55 4.3.1 The case
m
<
n
m < n
m
<
n
. . . . . . . . . . . . . . . . . . . . . . . 56 4.4 A topological approach . . . . . . . . . . . . . . . . . . . . . . . 64 4.5 Concluding remark . . . . . . . . . . . . . . . . . . . . . . . . . 67 Abstract (in Korean) 69 Acknowledgement (in Korean) 70Docto
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
SNU Open Repository and Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:s-space.snu.ac.kr:10371/16...
Last time updated on 27/11/2020