Archive of posts with tag '김연진'

• 1st Korean Workshop on Graph Theory

  1st Korean Workshop on Graph Theory

  August 26-28, 2015

  KAIST  (E6-1 1501 & 3435)

  http://home.kias.re.kr/MKG/h/KWGT2015/

  • Program Book
  • Currently, we are planning to have talks in KOREAN.
  • Students/postdocs may get the support for the accommodation. (Hotel Interciti)
  • Others may contact us if you wish to book a hotel at a pre-negotiated price. Please see the website.
  • We may or may not have contributed talks. If you want, please contact us.
  • PLEASE REGISTER UNTIL AUGUST 16.

  Location: KAIST

  • Room 1501 of E6-1 (August 26, 27)
  • Room 3435 of E6-1 (August 28)

  Invited Speakers:

  • Young Soo Kwon (권영수), Yeungnam Univ.
  • Seog-Jin Kim (김석진), Konkuk Univ.
  • Younjin Kim (김연진), KAIST
  • Jaehoon Kim (김재훈), Birmingham Univ.
  • Yoomi Rho (노유미), Univ. of Incheon
  • Boram Park (박보람), Ajou Univ.
  • Sejeong Bang (방세정), Yeungnam Univ.
  • Sang-il Oum (엄상일), KAIST
  • Sang June Lee (이상준), Duksung Women’s Univ.
  • Joonkyung Lee (이준경), Univ. of Oxford
  • Ilkyoo Choi (최일규), KAIST
  • Jeong-Ok Choi (최정옥), GIST

  Organizers:

  • Seog-Jin Kim (김석진), Konkuk Univ.
  • Sang-il Oum (엄상일), KAIST

  Tags:

  • 권영수
  • 김석진
  • 김연진
  • 김재훈
  • 노유미
  • 박보람
  • 방세정
  • 엄상일
  • 이상준
  • 이준경
  • 최일규
  • 최정옥

• 2014 KAIST CMC Discrete Math Workshop

  2014 KAIST CMC Discrete Math Workshop

  December 10–12, 2014

  자연과학동(E6-1), KAIST

  Preregistration in kcw2014.eventbrite.com deadline: Dec. 5 (Friday)

  ABSTRACTS

  Program (Dec.10 Wed-Room 1409)

  • 1:30-2:00 Registration
  • 2:00-2:30 Young Soo Kwon (권영수), Yeungnam University: A variation of list coloring and its properties
  • 2:40-3:10 Mitsugu Hirasaka, Pusan National University: Small topics on association schemes
  • 3:10-3:40 Coffee Break
  • 3:40-4:10 Younjin Kim (김연진),  KAIST: On Extremal Combinatorial Problems of Noga Alon
  • 4:20-4:50 Jang Soo Kim (김장수),  Sungkyunkwan University: A new q-Selberg integral, Schur functions, and Young books
  • 5:00-6:00 Discussion
  • 6:00- Dinner

  Program (Dec.11 Thurs-Room 1501 & 3435)

  • 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University (Room 1501) :
  • 12:00-1:30 Lunch
  • 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University (Room 1501) :
  • 3:00-3:40 Coffee Break
  • 3:40-4:10 Suyoung Choi (최수영),  Ajou University (Room 3435): T.B.A.
  • 4:20-4:50 Jaehoon Kim (김재훈),  University of Birmingham (Room 3435): Regular subgraphs in uniform hypergraphs
  • 5:00-5:30 Ilkyoo Choi (최일규), KAIST (Room 3435): On choosability with separation of planar graphs with forbidden cycles
  • 6:00- Banquet

  Program (Dec.12 Fri-Room 1501)

  • 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University :
  • 12:00-1:30 Lunch
  • 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University :
  • 3:00-3:30 Coffee Break
  • 3:30-4:30 Petr Hliněný,  Masaryk University: Planar graph emulators – Beyond planarity in the plane
  • 4:45-5:45 Discussion
  • 6:00- Dinner

  Tags:

  • MitsuguHirasaka
  • PetrHliněný
  • 권영수
  • 김연진
  • 김장수
  • 김재훈
  • 최수영
  • 최일규

• Younjin Kim (김연진), Cycle-saturated graphs with minimum number of edges

  Cycle-saturated graphs with minimum number of edges

  Younjin Kim (김연진)
  Department of Mathematical Sciences, KAIST

  2012/9/14 Fri 4PM-5PM

  A graph G is called H-saturated if it does not contain any copy of H, but for any edge e in the complement of G the graph G+e contains some H. The minimum size of an n-vertex H-saturated graph is denoted by sat(n,H). We prove sat(n,C_k) = n + n/k + O((n/k²) + k²) holds for all n≥k≥3, where C_k is a cycle with length k.
  Joint work with Zoltan Füredi.

  Tags:

  • 김연진