On fractional Helly properties in graphs without large complete minors = 큰 완전 그래프를 마이너로 가지지 않는 그래프에서의 fractional Helly 성질에 관하여

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 367
  • Download : 0
Helly's theorem is a classical result about intersection patterns of convex sets in Euclidean spaces. It states that every finite family of convex sets in $R^d$ is intersecting if every d+1 or fewer members are intersecting. There are a large number of generalizations and applications of Helly's theorem. For instance, the colorful and fractional Helly theorems and the (p,q)-theorem are important generalizations. It was proved by Alon et al. that the fractional Helly property is a key ingredient when establishing the (p,q)-theorem for abstract set-systems. Hence it has been one of the most fundamental questions in this field to find a sufficient condition that makes a non-empty family of sets satisfies the fractional Helly property. In this dissertation, we give an overview of classical Helly type theorems, and prove some combinatorial generalizations of Helly's theorem with a focus on the fractional Helly properties. Our first main topic is a combination of the colorful Helly theorem and the fractional Helly theorem. We introduce a purely combinatorial method to improve the bound of $B\'{a}r\'{a}ny$ et al.'s colorful fractional Helly theorem for convex sets. This proof technique can be easily modified to achieve a colorful fractional Helly theorem for abstract set-systems. The second main topic is about Helly type theorems for certain families of graphs. A connected cover in a graph G is a non-empty family $\mathcal{G}$ of induced subgraphs in G such that every non-empty intersection is connected. We prove some Helly type theorems for connected covers in graphs without large complete minors. In particular, the results on connected covers in planar graphs can be applied for set-systems which are more general than good covers in the plane.
Advisors
Holmsen, Andreasresearcher홈슨, 안드레아스researcher
Description
한국과학기술원 :수리과학과,
Publisher
한국과학기술원
Issue Date
2018
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 수리과학과, 2018.8,[iv, 61 p. :]

Keywords

Helly type theorems▼aconnected covers▼anerve complexes▼anerve theorems▼agraph minors; 헬리 정리▼aconnected covers▼anerve complexes▼anerve 정리▼a그래프 마이너

URI
http://hdl.handle.net/10203/264941
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=827915&flag=dissertation
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0