BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220527T132000
DTEND;TZID=Asia/Seoul:20220527T174000
DTSTAMP:20260423T210220
CREATED:20220527T042000Z
LAST-MODIFIED:20240707T075940Z
UID:5555-1653657600-1653673200@dimag.ibs.re.kr
SUMMARY:KSIAM 2022 Spring Meeting
DESCRIPTION:KSIAM (Korean Society for Industrial and Applied Mathematics) will have the KSIAM 2022 Spring Conference at the Institute for Basic Science (IBS). Its academic session for Combinatorics decided to have an invited talk by Joonkyung Lee at the Hanyang University\, a special session “Graph Theory” organized by Sang-il Oum and the IBS DIMAG\, a special session “Enumerative Combinatorics” organized by Dongsu Kim at KAIST\, and a poster session\, all on May 27 afternoon. The deadline for the abstract submission is May 2 and the deadline for the early registration is May 9. \nInvited talk (May 27 Friday\, 16:40-17:40)\n\nJoonkyung Lee이준경 (Hanyang University)\, Graph homomorphism inequalities and their applications\nCounting (weighted) homomorphisms between graphs relates to a wide variety of areas\, in- cluding graph theory\, probability\, statistical physics and theoretical computer science. In recent years\, various new applications of inequalities between graph homomorphism counts have been found.\nWe will discuss some of the examples\, including a simple proof of the Bondy–Simonovits theorem and a new estimate for the rainbow Turán numbers of even cycles. If time permits\, we will also touch upon some recent progress on Sidorenko’s conjecture and related questions\, in particular their applications on the bipartite Turán problems.\nBased on joint work with David Conlon\, Jaehoon Kim\, Hong Liu\, and Tuan Tran. \n\nSpecial session “Graph Theory” (May 27\, 13:20-14:40)\nOrganized by Sang-il Oum엄상일 (IBS Discrete Mathematics Group & KAIST). \nSpeakers\n\nBoram Park박보람 (Ajou University)\, Odd Coloring of Graphs\nAn odd $c$-coloring of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. Recently\, Cranston investigated odd colorings of graphs with bounded maximum average degree\, and conjectured that every graph $G$ with $\operatorname{mad}(G)\leq \frac{4c-4}{c+1}$ has an odd $c$-coloring for $c\geq 4$\, and proved the conjecture for $c\in\{5\, 6\}$. In particular\, planar graphs with girth at least $7$ and $6$ have an odd $5$-coloring and an odd $6$-coloring\, respectively.\nWe completely resolve Cranston’s conjecture. For $c\geq 7$\, we show that the conjecture is true\, in a stronger form that was implicitly suggested by Cranston\, but for $c=4$\, we construct counterexamples\, which all contain $5$-cycles. On the other hand\, we show that a graph $G$ with $\operatorname{mad}(G)<\frac{22}{9}$ and no induced $5$-cycles has an odd $4$-coloring. This implies that a planar graph with girth at least 11 has an odd $4$-coloring. We also prove that a planar graph with girth at least 5 has an odd $6$-coloring.\nJoint work with Eun-Kyung Cho\, Ilkyoo Choi\, and Hyemin Kown. \n\n\nJongyook Park박종육 (Kyungpook National University)\, On the Delsarte bound\nWe study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence\, we show that if a strongly regular graph contains a Delsarte clique\, then the parameter μ is either small or large. Furthermore\, we obtain a cubic polynomial that assures that a maximal clique in an amply regular graph is either small or large (under certain assumptions). Combining this cubic polynomial with the claw-bound\, we rule out an infinite family of feasible parameters (v\, k\, λ\, μ) for strongly regular graphs. Lastly\, we provide tables of parameters (v\, k\, λ\, μ) for nonexistent strongly regular graphs with smallest eigenvalue −4\,−5\,−6 or −7. This is joint work with Gary Greaves and Jack Koolen. \n\n\nO-joung Kwon권오정 (Hanyang University and IBS Discrete Mathematics Group)\, Well-partitioned chordal graphs\nWe introduce a new subclass of chordal graphs that generalizes the class of split graphs\, which we call well-partitioned chordal graphs. A connected graph $G$ is a well-partitioned chordal graph if there exist a partition $\mathcal{P}$ of the vertex set of $G$ into cliques and a tree $\mathcal{T}$ having $\mathcal{P}$ as a vertex set such that for distinct $X\,Y\in \mathcal{P}$\, (1) the edges between $X$ and $Y$ in $G$ form a complete bipartite subgraph whose parts are some subsets of $X$ and $Y$\, if $X$ and $Y$ are adjacent in $\mathcal{T}$\, and (2) there are no edges between $X$ and $Y$ in $G$ otherwise. A split graph with vertex partition $(C\, I)$ where $C$ is a clique and $I$ is an independent set is a well-partitioned chordal graph as witnessed by a star $\mathcal{T}$ having $C$ as the center and each vertex in $I$ as a leaf\, viewed as a clique of size $1$. We characterize well-partitioned chordal graphs by forbidden induced subgraphs\, and give a polynomial-time algorithm that given a graph\, either finds an obstruction\, or outputs a partition of its vertex set that asserts that the graph is well-partitioned chordal.\nWe observe that there are problems\, for instance Densest $k$-Subgraph and $b$-Coloring\, that are polynomial-time solvable on split graphs but become NP-hard on well-partitioned chordal graphs. On the other hand\, we show that the Geodetic Set problem\, known to be NP-hard on chordal graphs\, can be solved in polynomial time on well-partitioned chordal graphs. We also answer two combinatorial questions on well-partitioned chordal graphs that are open on chordal graphs\, namely that each well-partitioned chordal graph admits a polynomial-time constructible tree $3$-spanner\, and that each ($2$-connected) well-partitioned chordal graph has a vertex that intersects all its longest paths (cycles). Joint work with Jungho Ahn\, Lars Jaffke\, and Paloma T. Lima. \n\n\nStijn Cambie (IBS Extremal Combinatorics and Probability Group)\, Regular Cereceda’s Conjecture\nThe reconfiguration graph $\mathcal C_k(G)$ for the $k$-colourings of a graph $G$ has a vertex for each proper $k$-colouring of $G$\, and two vertices of $\mathcal C_k(G)$ are adjacent precisely when those $k$-colourings differ on a single vertex of $G$. Much work has focused on bounding the maximum value of $\operatorname{diam} \mathcal C_k(G)$ over all $n$-vertex graphs $G$. One of the most famous conjectures related related to $\mathcal C_k(G)$ is Cereceda’s conjecture\, which says that if $k \ge \operatorname{degen}(G) + 2$\, the diameter of $\mathcal C_k(G)$ is $O(n^2)$. In this talk\, we give some ideas towards a precise form for Cereceda’s conjecture\, when restricting to regular graphs. \nThis is based on joint work with Wouter Cames van Batenburg (TU Delft\, the Netherlands) and Daniel Cranston (Virginia Commonwealth University\, USA)\, which originates from the online workshop Graph Reconfiguration of the Sparse Graphs Coalition. \n\nSpecial session “Enumerative Combinatorics” (May 27\, 15:00-16:20)\nOrganized by Dongsu Kim김동수 (KAIST). \nSpeakers\n\nMeesue Yoo류미수 (Chungbuk National University)\, Combinatorial description for the Hall-Littlewood expansion of unicellular LLT and chromatic quasisymmetric polynomials\nIn this work\, we obtain a Hall–Littlewood expansion of the chromatic quasisymmetric functions by using a Dyck path model and linked rook placements. By using the Carlsson–Mellit relation between the chromatic quasisymmetric functions and the unicellular LLT polynomials\, this combinatorial description for the Hall–Littlewood coefficients of the chromatic quasisymmetric functions also gives the coefficients of the unicellular LLT polynomials expanded in terms of the modified transformed Hall–Littlewood polynomials. Joint work with Seung Jin Lee. \n\n\nDonghyun Kim김동현 (Sungkyunkwan University)\, Combinatorial formulas for the coefficients of the Al-Salam-Chihara polynomials\nThe Al-Salam-Chihara polynomials are an important family of orthogonal polynomials in one variable $x$ depending on 3 parameters $\alpha$\, $\beta$ and $q$. They are closely connected to a model from statistical mechanics called the partially asymmetric simple exclusion process (PASEP) and they can be obtained as a specialization of the Askey-Wilson polynomials. We give two different combinatorial formulas for the coefficients of the (transformed) Al-Salam-Chihara polynomials. Our formulas make manifest the fact that the coefficients are polynomials in $\alpha$\, $\beta$ and $q$ with positive coefficients. \n\n\nJisun Huh허지선 (Ajou University)\, Combinatorics on bounded Motzkin paths and its applications\nA free Motzkin path of length \(n\) is a lattice path which starts at \((0\,0)\) or \((0\,1)\)\, ends at \((n\,0)\)\, and has only up steps \(u=(1\,1)\)\, down steps \(d=(1\,-1)\)\, and flat steps \(f=(1\,0)\). In addition\, if a free Motzkin path starts at \((0\,0)\) and stays weakly above the \(x\)-axis\, then it is called a Motzkin path. In this talk\, we construct a bijection between \(F(m\,r\,k)\) and \(M(m\,r\,k)\)\, where \(F(m\,r\,k)\) is the set of free Motzkin paths of length \(m+r\) with \(r\) flat steps that are contained in the strip \(-\lfloor k/2 \rfloor \leq y \leq \lfloor (k+1)/2 \rfloor\) and \(M(m\,r\,k)\) is the set of Motzkin prefixed of length \(m+r\) with \(r\) flat steps that are contained in the strip \(0 \leq y \leq k\). Furthermore\, we provide path interpretations of ordinary/self-conjugate \(t\)-core partitions with \(m\)-corners as an application.\nThis is joint work with Hyunsoo Cho\, Hayan Nam\, and Jaebum Sohn. \n\n\nJihyeug Jang장지혁 (Sungkyunkwan University)\, A combinatorial model for the transition matrix between the Specht and web bases\nWe introduce a new class of permutations\, called web permutations. Using these permutations\, we provide a combinatorial interpretation for entries of the transition between the Specht and web bases\, which answers Rhoades’s question. Furthermore\, we study enumerative properties of these permutations. Joint work with Byung-Hak Hwang and Jaeseong Oh.
URL:https://dimag.ibs.re.kr/event/ksiam-2022-spring-meeting/
LOCATION:IBS Science Culture Center
CATEGORIES:Workshops and Conferences
ATTACH;FMTTYPE=image/png:https://dimag.ibs.re.kr/cms/wp-content/uploads/2022/05/main_ss20220329.png
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20221128
DTEND;VALUE=DATE:20221130
DTSTAMP:20260423T210220
CREATED:20221118T114614Z
LAST-MODIFIED:20240705T171025Z
UID:6495-1669593600-1669766399@dimag.ibs.re.kr
SUMMARY:The 2nd Workshop on Developments in Combinatorics
DESCRIPTION:Official website (with the abstract)\nOnline workshop “Developments in Combinatorics” \n \n\nInvited Speakers\nNov. 28 Monday\nJie Han\, Beijing Institute of Technology\n15:30 Seoul\, 14:30 Beijing\, 06:30 UK\, 07:30 EU \nJoonkyung Lee (이준경)\, Hanyang University\n16:10 Seoul\, 15:10 Beijing\, 07:10 UK\, 08:10 EU \nLior Gishboliner\, ETH Zürich\n16:50 Seoul\, 15:50 Beijing\, 07:50 UK\, 08:50 EU \nAlex Scott\, University of Oxford\n17:40 Seoul\, 16:40 Beijing\, 08:40 UK\, 09:40 EU \nDongyeap Kang (강동엽)\, University of Birmingham\n18:20 Seoul\, 17:20 Beijing\, 09:20 UK\, 10:20 EU \nNov. 29 Tuesday\nChong Shangguan\, Shandong University\n15:30 Seoul\, 14:30 Beijing\, 06:30 UK\, 07:30 EU \nZdeněk Dvořák\, Charles University\n16:10 Seoul\, 15:10 Beijing\, 07:10 UK\, 08:10 EU \nAndrzej Grzesik\, Jagiellonian University\n16:50 Seoul\, 15:50 Beijing\, 07:50 UK\, 08:50 EU \nImre Leader\, University of Cambridge\n17:40 Seoul\, 16:40 Beijing\, 08:40 UK\, 09:40 EU \nJozef Skokan\, The London School of Ecnomics and Political Science\n18:20 Seoul\, 17:20 Beijing\, 09:20 UK\, 10:20 EU \nOrganizers\n\nHong Liu\nGuanghui Wang\nBingyu Luan\n\nSponsors\n\nIBS Extremal Combinatorics and Probability Group\nShandong University\n\n 
URL:https://dimag.ibs.re.kr/event/2022-11-28/
LOCATION:Zoom ID: 346 934 4087 (202209)
CATEGORIES:Workshops and Conferences
ATTACH;FMTTYPE=image/jpeg:https://dimag.ibs.re.kr/cms/wp-content/uploads/2022/11/ecopro-sdu-workshop2022-scaled-1.jpeg
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230417
DTEND;VALUE=DATE:20230425
DTSTAMP:20260423T210220
CREATED:20221108T013322Z
LAST-MODIFIED:20240705T171116Z
UID:6435-1681689600-1682380799@dimag.ibs.re.kr
SUMMARY:MATRIX-IBS Workshop: Structural Graph Theory Downunder III
DESCRIPTION:Website: https://www.matrix-inst.org.au/events/structural-graph-theory-downunder-iii/ \nProgram Description:  \nThis program\, jointly organised by MATRIX and the Discrete Mathematics Group of the Korean Institute for Basic Science (IBS)\, builds on the “Structural Graph Theory Downunder” programs held at MATRIX in 2019 and 2022. In this short intensive workshop\, mathematicians from across the globe will come together to work on open problems in structural graph theory. The focus will be on graph colouring\, graph minors\, induced subgraphs\, and graph product structure theory. The majority of the time will be allocated to collaborative research\, with only a few talks describing recent advances. The goal is to create an environment where mathematicians at all career stages work side-by-side. We anticipate that open problems will be solved\, and lasting collaborations will be initiated. \nConfirmed Participants: \nRutger Campbell (Institute for Basic Science\, Korea)\nLinda Cook (Institute for Basic Science\, Korea)\nJames Davies (University of Cambridge\, UK)\nMarc Distel (Monash University\, Australia)\nZdeněk Dvořák (Charles University\, Czech Republic)\nBryce Frederickson (Emory University\, USA)\nAntónio Girão (University of Oxford\, UK)\nPascal Gollin (Institute for Basic Science\, Korea)\nKevin Hendrey (Institute for Basic Science\, Korea)\nRobert Hickingbotham (Monash University\, Australia)\nFreddie Illingworth (University of Oxford\, UK)\nO-joung Kwon (Hanyang University\, Korea)\nFlorian Lehner (University of Auckland\, New Zealand)\nAnita Liebenau (UNSW\, Australia)\nChun-Hung Liu (Texas A&M\, USA)\nRose McCarty (Princeton University\, USA)\nLukas Michel (University of Oxford\, UK)\nSang-il Oum (Institute for Basic Science and KAIST\, Korea)\nMichael Savery (University of Oxford\, UK)\nAlex Scott (University of Oxford\, UK)\nRaphael Steiner (ETH Zurich\, Switzerland)\nJane Tan (University of Oxford\, UK)\nSebastian Wiederrecht (Institute for Basic Science\, Korea)\nDavid Wood (Monash University\, Australia)\nLiana Yepremyan (Emory University\, USA)
URL:https://dimag.ibs.re.kr/event/2023-04-17/
LOCATION:MATRIX\, Australia
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230713T094000
DTEND;TZID=Asia/Seoul:20230713T105000
DTSTAMP:20260423T210220
CREATED:20230711T000049Z
LAST-MODIFIED:20240705T162121Z
UID:7377-1689241200-1689245400@dimag.ibs.re.kr
SUMMARY:Open Symposium at the Discrete Mathematics Group
DESCRIPTION:Program\n\n9:40-10:05: Sang-il OUM\, Obstructions for dense analogs of tree-depth\n10:05-10:20: Kevin HENDREY\, Structural and extremal results for twin-width\n10:20-10:35: Rutger CAMPBELL\, Down-sets in combinatorial posets\n10:35-10:50: Linda COOK\, Reuniting 𝜒-boundedness with polynomial 𝜒-boundedness
URL:https://dimag.ibs.re.kr/event/2023-07-11/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230809T100000
DTEND;TZID=Asia/Seoul:20230809T160000
DTSTAMP:20260423T210220
CREATED:20230802T144334Z
LAST-MODIFIED:20240707T073343Z
UID:7441-1691575200-1691596800@dimag.ibs.re.kr
SUMMARY:2023 Mini-Workshop on Discrete Geometry
DESCRIPTION:2023 Mini-Workshop on Discrete Geometry will be held on August 9th at Room B332\, Institute for Basic Science (IBS)\, Daejeon\, Republic of Korea. \nThe workshop consists of three presentations on recent results and an open problem session. \nResearchers who are highly interested in this field are welcome to attend. \nTentative schedule\n\n10:00-10:50 Michael Dobbins (SUNY Binghamton): Colorful intersections\, Tverberg partitions\, and geometric transversals\n11:00-11:30 Andreas Holmsen (KAIST): The topology of the complex of ordered partitions\n11:30-13:30 Lunch and free discussion\n13:30-14:10 Minki Kim김민기 (GIST): Some variants of the colorful Helly theorems\n14:20-16:00 Open problem session\n16:30-17:30 Discrete Math Seminar: R. Amzi Jeffs (Carnegie Mellon University)\n\nOrganizers\n\nAndreas Holmsen (KAIST)\nJinha Kim김진하 (IBS Discrete Mathematics Group)\nMinki Kim김민기 (GIST)\nSang-il Oum엄상일 (IBS Discrete Mathematics Group / KAIST)\n\nAbstracts\nMichael Dobbins (SUNY Binghamton): Colorful intersections\, Tverberg partitions\, and geometric transversals\nGiven three red convex sets and three blue convex sets in three-dimensional space\, suppose every red set intersects every blue set. Montejano’s theorem says there is a line that intersects all the red sets or all the blue sets. This was generalized to k-transversals in $\mathbb R^d$ by Montejano and Karasev using sophisticated algebraic and topological tools. Here we give further generalizations based on more accessible methods such as the test-map/configuration space scheme\, Sarkaria’s tensor method\, and discrete Morse theory. \nAndreas Holmsen (KAIST): The topology of the complex of ordered partitions\nThe set of partitions of {1\,…\,n} into k nonempty ordered parts can be equipped with a natural cell-complex structure which we denote by P(n\,k). Here we use discrete Morse theory to show that P(n\,k) is homotopy equivalent to a wedge of (n-k)-dimensional spheres\, where the number of spheres is given in terms of Stirling numbers of the second kind. Our result has applications related to geometric transversals and Tverberg partitions. \nMinki Kim (GIST): Some variants of the colorful Helly theorems\n\nGiven a finite family $F$ of nonempty sets\, the nerve of $F$ is the simplicial complex on $F$ whose simplices are precisely the intersecting subfamilies of $F$. The colorful Helly theorem\, which generalizes Helly’s theorem\, asserts the following: if $X$ is the nerve of the disjoint union of $d+1$ many finite families $F_1\,\ldots\,F_{d+1}$ of convex sets in $\mathbb{R}^d$ where each $F_i$ is not a simplex in $X$\, then there is a colorful $(d+1)$-tuple that is not a simplex of $X$. It was shown by Kalai and Meshulam that the same statement holds for $d$-collapsible/Leray complexes. In this talk\, I will explain the notion of $d$-collapsibility and $d$-Lerayness of simplicial complexes\, and present recent results on variants of the colorful Helly theorem and applications. This is based on joint work with Alan Lew.
URL:https://dimag.ibs.re.kr/event/2023-discrete-geometry/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231015
DTEND;VALUE=DATE:20231021
DTSTAMP:20260423T210220
CREATED:20230911T044555Z
LAST-MODIFIED:20240705T161223Z
UID:7616-1697328000-1697846399@dimag.ibs.re.kr
SUMMARY:2023 Vertex-Minor Workshop
DESCRIPTION:This workshop aims to foster collaborative discussions and explore the various aspects of vertex-minors\, including structural theory and their applications. \nThis event will be small-scale\, allowing for focused talks and meaningful interactions among participants. \nWebsite: https://indico.ibs.re.kr/event/596/
URL:https://dimag.ibs.re.kr/event/2023-vertex-minor-workshop/
LOCATION:SONO BELLE Jeju
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231101
DTEND;VALUE=DATE:20231106
DTSTAMP:20260423T210220
CREATED:20230911T044018Z
LAST-MODIFIED:20240705T161224Z
UID:7610-1698796800-1699228799@dimag.ibs.re.kr
SUMMARY:The 3rd East Asia Workshop on Extremal and Structural Graph Theory
DESCRIPTION:The 3rd East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory\, especially in the East Asia such as China\, Japan\, and Korea. \nWebsite: http://tgt.ynu.ac.jp/2023EastAsia.html
URL:https://dimag.ibs.re.kr/event/20231101/
LOCATION:The Southern Beach Hotel & Resort Okinawa
CATEGORIES:Workshops and Conferences
ORGANIZER;CN="Seog-Jin Kim (%EA%B9%80%EC%84%9D%EC%A7%84)":MAILTO:skim12@konkuk.ac.kr
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240715
DTEND;VALUE=DATE:20240720
DTSTAMP:20260423T210220
CREATED:20231122T060655Z
LAST-MODIFIED:20240705T155117Z
UID:7939-1721001600-1721433599@dimag.ibs.re.kr
SUMMARY:IBS-DIMAG workshop on combinatorics and geometric measure theory
DESCRIPTION:Website: https://cgmt.dimag.kr/ \nArrival Date: July 14\, 2024 Sunday. \nDeparture Date: July 20\, 2024 Saturday. \nOrganizers \n\nBen Lund (IBS Discrete Mathematics Group)\nDoowon Koh (Chungbuk National University)\nSang-il Oum (IBS Discrete Mathematics Group / KAIST)
URL:https://dimag.ibs.re.kr/event/2024-07-15/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240722
DTEND;VALUE=DATE:20240727
DTSTAMP:20260423T210220
CREATED:20240410T044447Z
LAST-MODIFIED:20240705T153024Z
UID:8506-1721606400-1722038399@dimag.ibs.re.kr
SUMMARY:2024 Summer School on Combinatorics and Algorithms (2024 조합론 및 알고리즘 여름학교)
DESCRIPTION:The 2024 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be a great opportunity for young and aspiring researchers to study topics which are important but not covered during the lectures in the university classes. This summer\, two lecture series\, combinatorial optimization and grid minor theorem\, will be given by two leading experts on the subjects. There will be exercise sessions where you form a team and solve challenging questions related to the lecture subjects. \nWebsite: https://combialgo.dimag.kr/ \nLecturers and Topics\n\nChien-Chung Huang (ENS Paris\, France): Combinatorial Optimization\n\nThis lecture (12.5h) will cover essential topics in combinatorial optimization including: Berge’s theorem\, Konig’s theorem\, Egervary’s theorem\, Karger’s min-cut algorithm and Gomory-Hu trees\, Edmonds’ blossom algorithm for maximum matching\, matroid 101\, multi-commodity flow and k-coverage problems. \n\nSebastian Wiederrecht (DIMAG-IBS\, Korea): From treewidth to grid minor theorem\n\nThis lecture (6h) will present the notion of tree decomposition\, treewidth and graph minor\, and introduce the grid minor theorem by Robertson and Seymour. Grid minor theory is deemed as one of the most important theory in modern graph theory and has many applications in algorithms design\, data structure\, logic\, etc.
URL:https://dimag.ibs.re.kr/event/2024-07-22/
LOCATION:Bldg. N1\, KAIST
CATEGORIES:Workshops and Conferences
ORGANIZER;CN="Eunjung Kim (%EA%B9%80%EC%9D%80%EC%A0%95)":MAILTO:eunjungkim78@gmail.com
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240729
DTEND;VALUE=DATE:20240803
DTSTAMP:20260423T210220
CREATED:20240126T071556Z
LAST-MODIFIED:20240705T154124Z
UID:8206-1722211200-1722643199@dimag.ibs.re.kr
SUMMARY:2024 Korean Student Combinatorics Workshop (KSCW2024\, 2024 조합론 학생 워크샵)
DESCRIPTION:Venue\nGongju Hanok Vilage (공주한옥마을) \nOrganizers\n\nDonggyu Kim (김동규)\, KAIST and IBS Discrete Mathematics Group\nSeokbeom Kim (김석범)\, KAIST and IBS Discrete Mathematics Group\nSeonghyuk Im (임성혁)\, KAIST and IBS Extremal Combinatorics and Probability Group\nHyunwoo Lee (이현우)\, KAIST and IBS Extremal Combinatorics and Probability Group\n\n 
URL:https://dimag.ibs.re.kr/event/kscw2024/
LOCATION:Gongju Hanok Village\, Gongju
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240819
DTEND;VALUE=DATE:20240824
DTSTAMP:20260423T210220
CREATED:20240214T010957Z
LAST-MODIFIED:20240705T154107Z
UID:8250-1724025600-1724457599@dimag.ibs.re.kr
SUMMARY:2024 Workshop on (Mostly) Matroids
DESCRIPTION:The 2024 Workshop on (Mostly) Matroids will be held in-person at the Institute for Basic Science (IBS)\, Daejeon\, South Korea\, from August 19\, 2024 to August 23\, 2024. We expect that most people would arrive on Sunday\, August 18 and leave on Saturday\, August 24. \nOur hope is that this workshop will continue the tradition of previous workshops held in Sittard (2008)\, Maastricht (2010\,2012)\, Princeton (2014)\, Eindhoven(2016)\, Waterloo (2017)\, and Baton Rouge (2019). The focus will be on all aspects of matroid theory\, including its connection to graph theory\, algebraic geometry\, and other areas of mathematics. \n 
URL:https://dimag.ibs.re.kr/event/wmm2024/
LOCATION:IBS Science Culture Center
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240828
DTEND;VALUE=DATE:20240831
DTSTAMP:20260423T210220
CREATED:20240117T144439Z
LAST-MODIFIED:20240705T154134Z
UID:8135-1724803200-1725062399@dimag.ibs.re.kr
SUMMARY:2024 Combinatorics Workshop (2024 조합론 학술대회)
DESCRIPTION:Website: https://cw2024.combinatorics.kr/ \nLocation\nChungbuk National University\, Cheongju\, Korea. \nAdvisory Committee\n\nCommittee of Discrete Mathematics\, The Korean Mathematical Society (Chair: Sang-il Oum\, IBS Discrete Mathematics Group / KAIST)\n\nSponsors\n\nIBS Discrete Mathematics Group.\nKorean Mathematical Society
URL:https://dimag.ibs.re.kr/event/2024-08-28/
LOCATION:Chungbuk National University
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241111T110000
DTEND;TZID=Asia/Seoul:20241111T173000
DTSTAMP:20260423T210220
CREATED:20241101T055140Z
LAST-MODIFIED:20241111T080120Z
UID:10031-1731322800-1731346200@dimag.ibs.re.kr
SUMMARY:IBS-DIMAG Workshop on Topology and Combinatorics
DESCRIPTION:The IBS-DIMAG Workshop on Topology and Combinatorics will be held on November 11\, 2024 at Room B332\, Institute for Basic Science (IBS)\, Daejeon\, South Korea. \nInvited Speakers (tentative)\n\nKarim Adiprasito (Jussieu Institute of Mathematics)\nMinho Cho조민호 (IBS Extremal Combinatorics and Probability Group)\nNiloufar Fuladi (INRIA Center of Université de Lorraine)\nMinki Kim김민기 (GIST)\nDohyeon Lee이도현 (KAIST & IBS Discrete Mathematics Group)\nGeunho Lim임근호 (Jussieu Institute of Mathematics)\nSemin Yoo유세민 (IBS Discrete Mathematics Group)\n\nTentative Schedule\n\n11:00-11:30 Karim Adiprasito\, The Charney Davis conjecture and Boolean decompositions\n12:00-14:00 Lunch Break\n14:00-14:30 Niloufar Fuladi\, Universal families of arcs and curves on surfaces\n14:30-15:00 Semin Yoo유세민\, The Charney-Davis conjecture and its related complexes (survey)\n15:00-15:30 Geunho Lim임근호\, Bounds on Cheeger-Gromov invariants and simplicial complexity of triangulated manifolds\n15:30-16:00 Break\n16:00-16:30 Minki Kim김민기\, Some extensions of the colorful Helly theorem\n16:30-17:00 Minho Cho조민호\, Fractional Helly theorems via weak saturation\n17:00-17:30 Dohyeon Lee이도현\, Betti number of clique complex of H-free graphs (survey)\n18:00-20:00 Banquet\n\nOrganizer\n\nSemin Yoo유세민\, IBS Discrete Mathematics Group\n\nAbstracts\nKarim Adiprasito\, The Charney Davis conjecture and Boolean decompositions\nI will present a novel approach to the Charney Davis conjecture by introducing anticommutative Lefschetz properties\, and studying them on the Danzer complex of flag spheres. \nSemin Yoo\, The Charney-Davis conjecture and its related complexes (survey)\nThe Charney-Davis conjecture lies in the intersection between topology and combinatorics. The conjecture is a special case of the Hopf-Chern-Thurston conjecture for all nonpositively curved\, piecewise Euclidean manifolds which are cellulated by regular Euclidean cubes. In 2001\, Davis and Okun solved the conjecture for a 4-dimensional case\, and some other partial results are also known. However\, the conjecture is still open so far. \nIn this talk\, I will describe five statements that solve the Charney-Davis conjecture and explain some complexes to achieve this goal. \nNiloufar Fuladi\, Universal families of arcs and curves on surfaces\nIn this talk I introduce a family of curves that realize all pants decomposition of a surface: a family of simple closed curves Γ on a surface realizes all types of pants decompositions if for any pants decomposition of the surface\, there exists a homeomorphism sending it to a subset of the curves in Γ. The study of such universal families of curves is motivated by questions on graph embeddings\, joint crossing numbers and finding an elusive center of moduli space. I will discuss the case of surfaces without punctures\, where we establish an exponential upper bound and a superlinear lower bound on the minimum size of the family of curves with this universal property. I also talk about a similar concept of universality for triangulations of polygons\, where we provide bounds which are tight up to logarithmic factors. In this talk\, I will explain the background and context and no prior knowledge in topology or surfaces is needed. \nThis is joint work with Arnaud de Mesmay and Hugo Parlier. \nGeunho Lim\, Bounds on Cheeger-Gromov invariants and simplicial complexity of triangulated manifolds\nUsing L^2 cohomology\, Cheeger and Gromov define the L^2 rho-invariant on manifolds with arbitrary fundamental groups\, as a generalization of the Atiyah-Singer rho-invariant. There are many interesting applications in geometry\, topology\, and combinatorics. In this talk\, we show linear bounds on the rho-invariants in terms of simplicial complexity of manifolds by using hyperbolization methods. As applications\, we give new concrete examples in the complexity theory of high-dimensional (homotopy) lens spaces. This is a joint work with Shmuel Weinberger. \nMinki Kim\, Some extensions of the colorful Helly theorem\nGiven $k > d$ finite families of convex sets in $\mathbb{R}^d$\, if every colorful $(d+1)$-tuple is intersecting\, then the union of $k-d$ color classes is intersecting. This is known as the colorful Helly theorem. Based on recent joint work with Alan Lew\, I will present some extensions of the colorful Helly theorem and their applications. \nMinho Cho\, Fractional Helly theorems via weak saturation\nTwo celebrated extensions of the classical Helly’s theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka\, Goodarzi\, and Tancer recently established the optimal bound for the unified generalization of the fractional and the colorful Helly theorems using a colored extension of the exterior algebra. In this talk\, we introduce a combinatorial reduction of both the fractional Helly theorem and its colorful version to a classical problem in extremal combinatorics known as weak saturation. No such results connecting the fractional Helly theorem and weak saturation are known in the long history of literature. These reductions\, along with basic linear algebraic arguments for the reduced weak saturation problems\, let us give new short proofs of the optimal bounds for both the fractional Helly theorem and its colorful version without using exterior algebra. \nThis is joint work with Debsoumya Chakraborti\, Jinha Kim\, and Minki Kim. \nDohyeon Lee\, Betti number of clique complex of H-free graphs (survey)\nThe clique complex of a graph is a simplicial complex whose faces correspond to cliques of the given graph. In this talk\, we investigate extremal properties of the Betti numbers of clique complexes. While general simplicial complexes with n vertices can have a total Betti number approximately $2^n$\, Adamaszek showed that Betti number of clique complex is bounded by around $1.32^n$. Furthermore\, if the underlying graph has an independence number at most two\, the bound tightens to $1.25^n$. Adiprasito\, Nevo\, and Tancer established additional bounds on the total Betti number for clique complexes of (induced) H-free graphs for various graph H\, along with constructions of graphs with large total Betti number. In another direction\, Zhang and Wu demonstrated that for ternary graphs (whose with no induced cycles of length 3n)\, the Betti number of the independence complex (the clique complex of the complement of a graph) is at most one. Indeed\, Jinha Kim showed that these independence complexes are either contractible or homotopy spheres.
URL:https://dimag.ibs.re.kr/event/2024-11-11/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250203
DTEND;VALUE=DATE:20250206
DTSTAMP:20260423T210220
CREATED:20250121T050727Z
LAST-MODIFIED:20250121T050727Z
UID:10456-1738540800-1738799999@dimag.ibs.re.kr
SUMMARY:IBS-DIMAG Winter School on Graph Minors\, Week 1
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/graph-minors-week-1/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250210
DTEND;VALUE=DATE:20250213
DTSTAMP:20260423T210220
CREATED:20250121T050854Z
LAST-MODIFIED:20250121T050854Z
UID:10460-1739145600-1739404799@dimag.ibs.re.kr
SUMMARY:IBS-DIMAG Winter School on Graph Minors\, Week 2
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/graph-minors-week-2/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250217
DTEND;VALUE=DATE:20250220
DTSTAMP:20260423T210220
CREATED:20250121T051001Z
LAST-MODIFIED:20250121T051001Z
UID:10462-1739750400-1740009599@dimag.ibs.re.kr
SUMMARY:IBS-DIMAG Winter School on Graph Minors\, Week 3
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/graph-minors-week-3/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250714T140000
DTEND;TZID=Asia/Seoul:20250718T170000
DTSTAMP:20260423T210220
CREATED:20250421T055000Z
LAST-MODIFIED:20250706T061119Z
UID:10816-1752501600-1752858000@dimag.ibs.re.kr
SUMMARY:2025 Summer School on Combinatorics and Algorithms (2025 조합론 및 알고리즘 여름학교)
DESCRIPTION:The 2025 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be a great opportunity for young and aspiring researchers to study topics which are important but not covered during the lectures in the university classes. \nWebsite: https://combialgo.dimag.kr/ \nLecturers and Topics\n\nÉdouard Bonnet\, LIP\, CNRS.\n\nInduced Subgraphs and Induced Minors of Graphs\n\n\nMichał Pilipczuk\, University of Warsaw.\n\nStructural Theory of Sparse Graphs\n\n\n\nSchedule\n\nStart on 14 July 2025 Monday\, 2 PM\nEnd on 18 July 2025 Friday\, 5 PM
URL:https://dimag.ibs.re.kr/event/2025-07-14/
LOCATION:POSTECH\, Pohang\, Korea
CATEGORIES:Workshops and Conferences
ORGANIZER;CN="Eunjung Kim (%EA%B9%80%EC%9D%80%EC%A0%95)":MAILTO:eunjungkim78@gmail.com
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250818
DTEND;VALUE=DATE:20250821
DTSTAMP:20260423T210220
CREATED:20250322T120039Z
LAST-MODIFIED:20250818T042052Z
UID:10706-1755475200-1755734399@dimag.ibs.re.kr
SUMMARY:2025 Combinatorics Workshop (2025 조합론 학술대회)
DESCRIPTION:Website: https://cw2025.combinatorics.kr \nInvited Speakers\n\nDongsu Kim (KAIST)\nEun Jung Kim (KAIST)\nO-joung Kwon (Hanyang University)\nAe Ja Lee (Pennsylvania State University)\nZhicong Lin (Shandong University)\n\nOrganizing Committee\n\nSang-il Oum (엄상일)\, IBS Discrete Mathematics Group\nJang Soo Kim (김장수)\, Sungkyunkwan University\nSeunghyun Seo (서승현)\, Kangwon National University
URL:https://dimag.ibs.re.kr/event/cw2025/
LOCATION:IBS Science Culture Center
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250820
DTEND;VALUE=DATE:20250825
DTSTAMP:20260423T210220
CREATED:20250722T052942Z
LAST-MODIFIED:20250722T053013Z
UID:11276-1755648000-1756079999@dimag.ibs.re.kr
SUMMARY:2025 Korean Student Combinatorics Workshop (KSCW2025: 2025 조합론 학생 워크샵)
DESCRIPTION:Venue\nThe K-Hotel Gyeongju \nWebsite\nhttps://indico.ibs.re.kr/e/kscw2025 \nOrganizers\n\nSeokbeom Kim (김석범)\, KAIST and IBS Discrete Mathematics Group\nHyunwoo Lee (이현우)\, KAIST and IBS Extremal Combinatorics and Probability Group\nJaehyeon Seo (서재현)\, Yonsei University\nKyungjin Cho (조경진)\, POSTECH
URL:https://dimag.ibs.re.kr/event/kscw2025/
LOCATION:The K-Hotel Gyeongju
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20251127
DTEND;VALUE=DATE:20251201
DTSTAMP:20260423T210220
CREATED:20250421T055422Z
LAST-MODIFIED:20251130T005151Z
UID:10819-1764201600-1764547199@dimag.ibs.re.kr
SUMMARY:5th East Asia Workshop on Extremal and Structural Graph Theory
DESCRIPTION:The 5th East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory\, especially in the East Asia such as China\, Japan\, and Korea. \n \nDate\nNovember 27\, 2025 Thursday (Arrival Day) — November 30\, 2025 Sunday (Departure Day) \nVenue\nFraser Place Namdaemun\, Seoul \nProgram Book\nInvited Speakers\n\nShinya Fujita (Yokohama City University)\nJie Han (Beijing Institute of Technology)\nTony Huynh (IBS Discrete Mathematics Group)\nJaehoon Kim (KAIST)\nO-joung Kwon (Hanyang University / IBS Discrete Mathematics Group)\nHong Liu (IBS Extremal Combinatorics and Probability Group)\nJie Ma (University of Science and Technology of China / Tsinghua University)\nShun-ichi Maezawa (Nihon University)\nBoram Park (Seoul National University)\nShohei Satake (Kumamoto University)\nTuan Tran (University of Science and Technology of China)\nShoichi Tsuchiya (Senshu University)\nXuding Zhu (Zhejiang Normal University)\n\nOrganizers\nSeog-Jin Kim\, Sang-il Oum\, Kenta Ozeki\, Hehui Wu \nRegistration\nInvitation Only. https://indico.ibs.re.kr/event/1041/ \nThere is no registration fee and one dinner (banquet) will be provided. \nHistory\n\n4th East Asia Workshop on Extremal and Structural Graph Theory\n\nMar. 27 – Mar. 31\, 2025.\nSchool of Mathematics\, Sun-Yet Sen University\, Guangzhou\, China\nOrganizers: Ping Hu\, Seog-Jin Kim\, Kenta Ozeki\, Hehui Wu.\n\n\n\n\n3rd East Asia Workshop on Extremal and Structural Graph Theory\n\nNov. 1- Nov. 5\, 2023.\nThe Southern Beach Hotel & Resort\, Okinawa\, Japan\nSponsored by the IBS Discrete Mathematics Group\, Korea.\nOrganizers: Seog-Jin Kim\, Sang-il Oum\, Kenta Ozeki\, Hehui Wu.\n\n\n2nd East Asia Workshop on Extremal and Structural Graph Theory\n\nOct. 31-Nov. 4\, 2019.\nHeld at UTOP UBLESS Hotel\, Jeju\, Korea\nSponsored by the IBS Discrete Mathematics Group\, Korea.\nOrganizers: Seog-Jin Kim\, Sang-il Oum\, Kenta Ozeki\, Hehui Wu.\n\n\n1st East Asia Workshop on Extremal and Structural Graph Theory\n\nNov. 30-Dec. 2\, 2018.\nHeld and sponsored by the Shanghai Center for Mathematical Sciences in China\, under the name 2018 SCMS Workshop on Extremal and Structural Graph Theory.\nOrganizers: Ping Hu\, Seog-Jin Kim\, Kenta Ozeki\, Hehui Wu.\n\n\n\n\n\nThursday\nNovember 27\, 2025\n\n\n\n\nTime\nSpeaker\nAffiliation\nTitle\n\n\n\n\n16:00–18:00\n\nRegistration & Discussions\n\n\n\n\n \n\n\nFriday\nNovember 28\, 2025\n\n\n\n\nTime\nSpeaker\nAffiliation\nTitle\n\n\n\n\n09:20–10:00\nJaehoon Kim\nKAIST\nHamilton cycles in pseudorandom graphs: Dirac’s theorem and approximate decompositions\n\n\n10:00–10:30\n\nCoffee Break\n\n\n10:30–11:10\nJie Ma\nUniversity of Science and Technology of China / Tsinghua University\nAn exponential improvement for Ramsey lower bounds\n\n\n11:20–12:00\nShinya Fujita\nYokohama City University\nConnectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs\n\n\n12:00–14:00\n\nLunch Break\n\n\n14:00–14:40\nShun-ichi Maezawa\nNihon University\nTree versus tree of preorder induced by rainbow forbidden subgraphs\n\n\n14:50–15:30\nTony Huynh\nIBS Discrete Mathematics Group\nRainbow triangles and the Erdős–Hajnal problem in projective geometries\n\n\n15:30–15:50\n\nCoffee Break\n\n\n16:30–17:30\n\nProblem Session\n\n\n\n\n \n\n\nSaturday\nNovember 29\, 2025\n\n\n\n\nTime\nSpeaker\nAffiliation\nTitle\n\n\n\n\n09:20–10:00\nXuding Zhu\nZhejiang Normal University\nTBA\n\n\n10:00–10:30\n\nCoffee Break\n\n\n10:30–11:10\nHong Liu\nIBS Extremal Combinatorics and Probability Group\nChromatic\, homomorphism\, blowup thresholds and beyond\n\n\n11:20–12:00\nShohei Satake\nKumamoto University\nTBA\n\n\n12:00–14:00\n\nLunch Break\n\n\n14:00–14:40\nShoichi Tsuchiya\nSenshu University\nOn the number of contractible edges in plane triangulations\n\n\n14:50–15:30\nTuan Tran\nUniversity of Science and Technology of China\nLittlewood-Offord bounds on the symmetric groups and applications\n\n\n15:30–15:50\n\nCoffee Break\n\n\n15:50–16:30\nO-joung Kwon\nHanyang University / IBS Discrete Mathematics Group\nA coarse Erdős–Pósa theorem\n\n\n16:30–17:30\n\nProblem Session\n\n\n18:30–21:00\n\nBanquet\n\n\n\n\n \n\n\nSunday\nNovember 30\, 2025\n\n\n\n\nTime\nSpeaker\nAffiliation\nTitle\n\n\n\n\n10:00–10:40\nJie Han\nBeijing Institute of Technology\nPerturbation of dense graphs\n\n\n10:40–10:50\n\nBreak\n\n\n10:50–11:30\nBoram Park\nSeoul National University\nGraphs avoiding cycles of length 0 modulo 4\n\n\n11:30–12:00\n\nClosing
URL:https://dimag.ibs.re.kr/event/2025-east-asia-graph-theory/
LOCATION:Seoul\, Korea
CATEGORIES:Workshops and Conferences
ORGANIZER;CN="Seog-Jin Kim (%EA%B9%80%EC%84%9D%EC%A7%84)":MAILTO:skim12@konkuk.ac.kr
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260628
DTEND;VALUE=DATE:20260712
DTSTAMP:20260423T210220
CREATED:20260415T104127Z
LAST-MODIFIED:20260415T104444Z
UID:12537-1782604800-1783814399@dimag.ibs.re.kr
SUMMARY:2026 Workshop on Topological Combinatorics
DESCRIPTION:The 2026 Workshop on Topological Combinatorics will be held from June 28 to July 11\, 2026 at Gwangju Institute of Science and Technology (GIST)\, located in Gwangju in the southwest of Republic of Korea.  \nThe workshop aims to bring together researchers interested in applications of topology to combinatorics and related areas. This will be the fifth workshop in a series initiated by Ron Aharoni (August 2018 in Shantou\, July 2019 in Prague\, July 2020 on Zoom\, and June 2024 in Paris). \nThe first week (June 28 – July 04) will be reserved for presentations\, while the following days (July 05 – July 11) will be for discussion and collaborations.  \nThe campus offers a variety of amenities\, including a guesthouse that can accommodate approximately 20 guests. \nIn addition\, various lodging options are available within a 15–20 minute walking distance. \nWe are planning to provide accommodation for all invited participants\, and we are also considering offering partial travel support for those with limited funding. \n\nWebsite: https://sites.google.com/view/2026topocomb
URL:https://dimag.ibs.re.kr/event/2026-06-28/
LOCATION:GIST
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260727
DTEND;VALUE=DATE:20260801
DTSTAMP:20260423T210220
CREATED:20260415T104353Z
LAST-MODIFIED:20260415T104353Z
UID:12545-1785110400-1785542399@dimag.ibs.re.kr
SUMMARY:2026 Korean Student Combinatorics Workshop
DESCRIPTION:Website: https://kscw.combinatorics.kr/
URL:https://dimag.ibs.re.kr/event/2026-07-27/
LOCATION:Gongju Hanok Village\, Gongju
CATEGORIES:Workshops and Conferences
END:VEVENT
END:VCALENDAR