On online Ramsey theoryOnline Ramsey theory에 대하여

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 815
  • Download : 0
The investigation of online Ramsey theory on specific graph classes was initiated in 2004 by Grytczuk, Hal uszczak, and Kierstead. They studied online Ramsey theory on forests, k-colorable graphs, outerplanar graphs, and planar graphs. Recently, Petrickova continued the study of online Ramsey theory on planar graphs further by disproving a conjecture by Grytczuk, Hal uszczak, and Kierstead. We carry on the study of online Ramsey theory by considering classes of graphs with one forbidden subgraph. We focus on characterizing the classes where Painter wins the online Ramsey game for $C_3$ on C where C is the class of F-free graphs for a connected graph F; we succeed the characterization except for when F is one particular graph. We also show that Painter wins the online Ramsey game for $C_3$ on C when C is the class of $K_4$ -minor-free graphs, extending a result by Grytczuk, Haluszczak, and Kierstead.
Advisors
Oum, Sang-ilresearcher엄상일researcher
Description
한국과학기술원 :수리과학과,
Publisher
한국과학기술원
Issue Date
2016
Identifier
325007
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 수리과학과, 2016.2 ,[iii, 23 p. :]

Keywords

online Ramsey; Ramsey; online Ramsey theory; Ramsey theory; graph theory; 램지; 램지 이론; 그래프; 그래프 이론; 온라인 램지

URI
http://hdl.handle.net/10203/221546
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=649519&flag=dissertation
Appears in Collection
MA-Theses_Master(석사논문)
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