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:20230511T161500
DTEND;TZID=Asia/Seoul:20230511T171500
DTSTAMP:20260416T212246
CREATED:20230301T130657Z
LAST-MODIFIED:20240705T165043Z
UID:6864-1683821700-1683825300@dimag.ibs.re.kr
SUMMARY:Maria Chudnovsky\, Induced subgraphs and tree decompositions
DESCRIPTION:Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph. Tree decompositions have traditionally been used in the context of forbidden graph minors; bringing them into the realm of forbidden induced subgraphs has until recently remained out of reach. Over the last couple of years we have made significant progress in this direction\, exploring both the classical notion of bounded tree-width\, and concepts of more structural flavor. This talk will survey some of these ideas and results.
URL:https://dimag.ibs.re.kr/event/2023-05-11/
LOCATION:Room 1501\, Bldg. E6-1\, KAIST
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230509T163000
DTEND;TZID=Asia/Seoul:20230509T173000
DTSTAMP:20260416T212246
CREATED:20230413T233653Z
LAST-MODIFIED:20240707T073713Z
UID:7041-1683649800-1683653400@dimag.ibs.re.kr
SUMMARY:Jozef Skokan\, Separating the edges of a graph by a linear number of paths
DESCRIPTION:Recently\, Letzter proved that any graph of order n contains a collection P of $O(n \log^*n)$ paths with the following property: for all distinct edges e and f there exists a path in P which contains e but not f. We improve this upper bound to 19n\, thus answering a question of Katona and confirming a conjecture independently posed by Balogh\, Csaba\, Martin\, and Pluhar and by Falgas-Ravry\, Kittipassorn\, Korandi\, Letzter\, and Narayanan. \nOur proof is elementary and self-contained.
URL:https://dimag.ibs.re.kr/event/2023-05-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230502T163000
DTEND;TZID=Asia/Seoul:20230502T173000
DTSTAMP:20260416T212246
CREATED:20230315T140009Z
LAST-MODIFIED:20240705T164210Z
UID:6916-1683045000-1683048600@dimag.ibs.re.kr
SUMMARY:Rob Morris\, An exponential improvement for diagonal Ramsey
DESCRIPTION:The Ramsey number $R(k)$ is the minimum n such that every red-blue colouring of the edges of the complete graph on n vertices contains a monochromatic copy of $K_k$. It has been known since the work of Erdős and Szekeres in 1935\, and Erdős in 1947\, that $2^{k/2} < R(k) < 4^k$\, but in the decades since the only improvements have been by lower order terms. In this talk I will sketch the proof of a very recent result\, which improves the upper bound of Erdős and Szekeres by a (small) exponential factor. \nBased on joint work with Marcelo Campos\, Simon Griffiths and Julian Sahasrabudhe.
URL:https://dimag.ibs.re.kr/event/2023-05-02/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230427T161500
DTEND;TZID=Asia/Seoul:20230427T171500
DTSTAMP:20260416T212246
CREATED:20230321T001954Z
LAST-MODIFIED:20240705T164205Z
UID:6930-1682612100-1682615700@dimag.ibs.re.kr
SUMMARY:Rob Morris\, Ramsey theory: searching for order in chaos
DESCRIPTION:In many different areas of mathematics (such as number theory\, discrete geometry\, and combinatorics)\, one is often presented with a large “unstructured” object\, and asked to find a smaller “structured” object inside it. One of the earliest and most influential examples of this phenomenon was the theorem of Ramsey\, proved in 1930\, which states that if n = n(k) is large enough\, then in any red-blue colouring of the edges of the complete graph on n vertices\, there exists a monochromatic clique on k vertices. In this talk I will discuss some of the questions\, ideas\, and new techniques that were inspired by this theorem\, and present some recent progress on one of the central problems in the area: bounding the so-called “diagonal” Ramsey numbers. Based on joint work with Marcelo Campos\, Simon Griffiths and Julian Sahasrabudhe.
URL:https://dimag.ibs.re.kr/event/2023-04-27/
LOCATION:Room 1501\, Bldg. E6-1\, KAIST
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230425T163000
DTEND;TZID=Asia/Seoul:20230425T173000
DTSTAMP:20260416T212246
CREATED:20230315T025543Z
LAST-MODIFIED:20240707T073739Z
UID:6905-1682440200-1682443800@dimag.ibs.re.kr
SUMMARY:Hyunwoo Lee (이현우)\, On perfect subdivision tilings
DESCRIPTION:For a given graph $H$\, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta_{sub}(n\, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$\, we asymptotically determined the value of $\delta_{sub}(n\, H)$. More precisely\, for every graph $H$ with at least one edge\, there is a constant $1 < \xi^*(H)\leq 2$ such that $\delta_{sub}(n\, H) = \left(1 - \frac{1}{\xi^*(H)} + o(1) \right)n$ if $H$ has a bipartite subdivision with two parts having different parities. Otherwise\, the threshold depends on the parity of $n$.
URL:https://dimag.ibs.re.kr/event/2023-04-25/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230419T163000
DTEND;TZID=Asia/Seoul:20230419T173000
DTSTAMP:20260416T212246
CREATED:20230301T064147Z
LAST-MODIFIED:20240705T165047Z
UID:6852-1681921800-1681925400@dimag.ibs.re.kr
SUMMARY:Shin-ichiro Seki\, On the extension of the Green-Tao theorem to number fields
DESCRIPTION:In 2006\, Tao established the Gaussian counterpart of the celebrated Green-Tao theorem on arithmetic progressions of primes. In this talk\, I will explain the extension of Tao’s theorem and the Green-Tao theorem to the case of general number fields. Our combinatorial tool is the relative hypergraph removal lemma by Conlon-Fox-Zhao. I will discuss the difficulties that arise in the case of general number fields and an application of our results to prime representations by binary quadratic forms. This is based on joint work with Wataru Kai\, Masato Mimura\, Akihiro Munemasa\, and Kiyoto Yoshino.
URL:https://dimag.ibs.re.kr/event/2023-04-19/
LOCATION:Zoom ID: 897 6822 0619 (ibsecopro) [04/19 only]
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230417
DTEND;VALUE=DATE:20230425
DTSTAMP:20260416T212246
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:20230411T163000
DTEND;TZID=Asia/Seoul:20230411T173000
DTSTAMP:20260416T212246
CREATED:20230220T150254Z
LAST-MODIFIED:20240705T165050Z
UID:6812-1681230600-1681234200@dimag.ibs.re.kr
SUMMARY:James Davies\, Two structural results for pivot-minors
DESCRIPTION:Pivot-minors can be thought of as a dense analogue of graph minors. We shall discuss pivot-minors and two recent results for proper pivot-minor-closed classes of graphs. In particular\, that for every graph H\, the class of graphs containing no H-pivot-minor is 𝜒-bounded\, and also satisfies the (strong) Erdős-Hajnal property.
URL:https://dimag.ibs.re.kr/event/2023-04-11/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230406T100000
DTEND;TZID=Asia/Seoul:20230406T110000
DTSTAMP:20260416T212246
CREATED:20230118T233830Z
LAST-MODIFIED:20240707T073746Z
UID:6691-1680775200-1680778800@dimag.ibs.re.kr
SUMMARY:Jie Han\, Spanning trees in expanders
DESCRIPTION:We consider the spanning tree embedding problem in dense graphs without bipartite holes and sparse graphs. In 2005\, Alon\, Krivelevich and Sudakov asked for determining the best possible spectral gap forcing an $(n\,d\,\lambda)$-graph to be $T(n\, \Delta)$-universal. In this talk\, we introduce our recent work on this conjecture.
URL:https://dimag.ibs.re.kr/event/2023-04-06/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230404T163000
DTEND;TZID=Asia/Seoul:20230404T173000
DTSTAMP:20260416T212246
CREATED:20230116T010354Z
LAST-MODIFIED:20240707T073814Z
UID:6667-1680625800-1680629400@dimag.ibs.re.kr
SUMMARY:István Tomon\, Configurations of boxes
DESCRIPTION:Configurations of axis-parallel boxes in $\mathbb{R}^d$ are extensively studied in combinatorial geometry. Despite their perceived simplicity\, there are many problems involving their structure that are not well understood. I will talk about a construction that shows that their structure might be more complicated than people conjectured.
URL:https://dimag.ibs.re.kr/event/2023-04-04/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230328T163000
DTEND;TZID=Asia/Seoul:20230328T173000
DTSTAMP:20260416T212246
CREATED:20230223T141945Z
LAST-MODIFIED:20240705T165050Z
UID:6831-1680021000-1680024600@dimag.ibs.re.kr
SUMMARY:Tianchi Yang\, On the maximum number of edges in k-critical graphs
DESCRIPTION:In this talk\, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k\, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will showcase an improvement on previous results achieved by employing a combination of extremal graph theory and structural analysis. We will introduce a key lemma\, which may be of independent interest\, as it sheds light on the partial structure of dense k-critical graphs. This is joint work with Cong Luo and Jie Ma.
URL:https://dimag.ibs.re.kr/event/2023-03-28/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230322T163000
DTEND;TZID=Asia/Seoul:20230322T173000
DTSTAMP:20260416T212246
CREATED:20230118T233720Z
LAST-MODIFIED:20240707T092054Z
UID:6688-1679502600-1679506200@dimag.ibs.re.kr
SUMMARY:Qizhong Lin\, Two classical Ramsey-Turán numbers involving triangles
DESCRIPTION:In 1993\, Erdős\, Hajnal\, Simonovits\, Sós and Szemerédi proposed to determine the value of Ramsey-Turán density $\rho(3\,q)$ for $q\ge3$. Erdős et al. (1993) and Kim\, Kim and Liu (2019) proposed two corresponding conjectures. However\, we only know four values of this Ramsey-Turán density by Erdős et al. (1993). There is no progress on this classical Ramsey-Turán density since then. In this talk\, I will introduce two new values of this classical Ramsey-Turán density. Moreover\, the corresponding asymptotically extremal structures are weakly stable\, which answers a problem of Erdős et al. (1993) for the two cases. Joint work with Xinyu Hu.
URL:https://dimag.ibs.re.kr/event/2023-03-22/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230321T163000
DTEND;TZID=Asia/Seoul:20230321T173000
DTSTAMP:20260416T212246
CREATED:20230204T071556Z
LAST-MODIFIED:20240705T170008Z
UID:6762-1679416200-1679419800@dimag.ibs.re.kr
SUMMARY:Younjin Kim (김연진)\, Problems on Extremal Combinatorics
DESCRIPTION:Extremal Combinatorics studies the maximum or minimum size of finite objects (numbers\, sets\, graphs) satisfying certain properties. In this talk\, I introduce the conjectures I solved on Extremal Combinatorics\, and also introduce recent extremal problems.
URL:https://dimag.ibs.re.kr/event/2023-03-21/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230316T100000
DTEND;TZID=Asia/Seoul:20230316T110000
DTSTAMP:20260416T212246
CREATED:20230213T121859Z
LAST-MODIFIED:20240707T073949Z
UID:6788-1678960800-1678964400@dimag.ibs.re.kr
SUMMARY:Paul Seymour\, A loglog step towards the Erdős-Hajnal conjecture
DESCRIPTION:In 1977\, Erdős and Hajnal made the conjecture that\, for every graph $H$\, there exists $c>0$ such that every $H$-free graph $G$ has a clique or stable set of size at least $|G|^c$; and they proved that this is true with $|G|^c$ replaced by $2^{c\sqrt{\log |G|}}$. \nThere has no improvement on this result (for general $H$) until now\, but now we have an improvement: that for every graph $H$\, there exists $c>0$ such that every $H$-free graph $G$ with $|G|\ge 2$ has a clique or stable set of size at least $$2^{c\sqrt{\log |G|\log\log|G|}}.$$ This talk will outline the proof. \nJoint work with Matija Bucić\, Tung Nguyen and Alex Scott.
URL:https://dimag.ibs.re.kr/event/2023-03-16/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230314T163000
DTEND;TZID=Asia/Seoul:20230314T173000
DTSTAMP:20260416T212246
CREATED:20230120T011459Z
LAST-MODIFIED:20240707T073956Z
UID:6701-1678811400-1678815000@dimag.ibs.re.kr
SUMMARY:Stijn Cambie\, Recent progress on the Union-closed conjecture and related
DESCRIPTION:We give a summary on the work of the last months related to Frankl’s Union-Closed conjecture and its offsprings. The initial conjecture is stated as a theorem in extremal set theory; when a family F is union-closed (the union of sets of F is itself a set of $\mathcal F$)\, then $\mathcal F$ contains an (abundant) element that belongs to at least half of the sets. Meanwhile\, there are many related versions of the conjecture due to Frankl. For example\, graph theorists may prefer the equivalent statement that every bipartite graph has a vertex that belongs to no more than half of the maximal independent sets. While even proving the ε-Union-Closed Sets Conjecture was out of reach\, Poonen and Cui & Hu conjectured already stronger forms. \nAt the end of last year\, progress was made on many of these conjectures. Gilmer proved the ε-Union-Closed Sets Conjecture using an elegant entropy-based method which was sharpened by many others. Despite a sharp approximate form of the union-closed conjecture as stated by Chase and Lovett\, a further improvement was possible. In a different direction\, Kabela\, Polak and Teska constructed union-closed family sets with large sets and few abundant elements. \nThis talk will keep the audience up-to-date and give them insight in the main ideas. \nPeople who would like more details\, can join the Ecopro-reading session on the 14th of March (10 o’clock\, B332) as well. Here we go deeper in the core of the proofs and discuss possible directions for the full resolution.
URL:https://dimag.ibs.re.kr/event/2023-03-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230309T100000
DTEND;TZID=Asia/Seoul:20230309T110000
DTSTAMP:20260416T212246
CREATED:20230118T233622Z
LAST-MODIFIED:20240707T074003Z
UID:6685-1678356000-1678359600@dimag.ibs.re.kr
SUMMARY:Marcelo Sales\, On Pisier type problems
DESCRIPTION:A subset $A\subseteq \mathbb Z$ of integers is free if for every two distinct subsets $B\, B’\subseteq A$ we have \[ \sum_{b\in B}b\neq \sum_{b’\in B’} b’.\]Pisier asked if for every subset $A\subseteq \mathbb Z$ of integers the following two statement are equivalent: \n(i) $A$ is a union of finitely many free sets.\n(ii) There exists $\epsilon>0$ such that every finite subset $B\subseteq A$ contains a free subset $C\subseteq B$ with $|C|\geq \epsilon |B|$. \nIn a more general framework\, the Pisier question can be seen as the problem of determining if statements (i) and (ii) are equivalent for subsets of a given structure with prescribed property. We study the problem for several structures including $B_h$-sets\, arithmetic progressions\, independent sets in hypergraphs and configurations in the euclidean space. This is joint work with Jaroslav Nešetřil and Vojtech Rödl.
URL:https://dimag.ibs.re.kr/event/2023-03-09/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230307T163000
DTEND;TZID=Asia/Seoul:20230307T173000
DTSTAMP:20260416T212246
CREATED:20230111T063520Z
LAST-MODIFIED:20240707T074009Z
UID:6655-1678206600-1678210200@dimag.ibs.re.kr
SUMMARY:Eunjin Oh (오은진)\, Parameterized algorithms for the planar disjoint paths problem
DESCRIPTION:Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_i\,t_i)_{i=1}^k$ of vertices\, the goal of the planar disjoint paths problem is to find a set $\mathcal P$ of $k$ pairwise vertex-disjoint paths connecting $s_i$ and $t_i$ for all indices $i\in\{1\,\ldots\,k\}$. This problem has been studied extensively due to its numerous applications such as VLSI layout and circuit routing. However\, this problem is NP-complete even for grid graphs. This motivates the study of this problem from the viewpoint of parameterized algorithms. \nIn this talk\, I will present a $2^{O(k^2)}n$-time algorithm for the planar disjoint paths problem. This improves the two previously best-known algorithms: $2^{2^{O(k)}}n$-time algorithm [Discrete Applied Mathematics 1995] and $2^{O(k^2)}n^6$-time algorithm [STOC 2020]. \nThis is joint work with Kyungjin Cho and Seunghyeok Oh.
URL:https://dimag.ibs.re.kr/event/2023-03-07/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230228T163000
DTEND;TZID=Asia/Seoul:20230228T173000
DTSTAMP:20260416T212246
CREATED:20230213T001557Z
LAST-MODIFIED:20240707T074017Z
UID:6782-1677601800-1677605400@dimag.ibs.re.kr
SUMMARY:Maya Sankar\, The Turán Numbers of Homeomorphs
DESCRIPTION:Let $X$ be a 2-dimensional simplicial complex. Denote by $\text{ex}_{\hom}(n\,X)$ the maximum number of 2-simplices in an $n$-vertex simplicial complex that has no sub-simplicial complex homeomorphic to $X$. The asymptotics of $\text{ex}_{\hom}(n\,X)$ have recently been determined for all surfaces $X$. I will discuss these results\, as well as ongoing work bounding $\text{ex}_{\hom}(n\,X)$ for arbitrary 2-dimensional simplicial complexes $X$.
URL:https://dimag.ibs.re.kr/event/2023-02-28/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230222T170000
DTEND;TZID=Asia/Seoul:20230222T180000
DTSTAMP:20260416T212246
CREATED:20221115T011207Z
LAST-MODIFIED:20240707T074027Z
UID:6483-1677085200-1677088800@dimag.ibs.re.kr
SUMMARY:Daniel Altman\, On an arithmetic Sidorenko conjecture\, and a question of Alon
DESCRIPTION:Let $G=\mathbb{F}_p^n$. Which systems of linear equations $\Psi$ have the property that amongst all subsets of $G$ of fixed density\, random subsets minimise the number of solutions to $\Psi$? This is an arithmetic analogue of a well-known conjecture of Sidorenko in graph theory\, which has remained open and of great interest since the 1980s. We will discuss some recent results along these lines\, with particular focus on some of the ideas behind a negative answer to a related question of Alon.
URL:https://dimag.ibs.re.kr/event/2023-02-22/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230221T163000
DTEND;TZID=Asia/Seoul:20230221T173000
DTSTAMP:20260416T212247
CREATED:20230110T061742Z
LAST-MODIFIED:20240705T170041Z
UID:6636-1676997000-1677000600@dimag.ibs.re.kr
SUMMARY:Meike Hatzel\, Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parametrised by the Size of the Cutset: Twin-Width Meets Flow-Augmentation
DESCRIPTION:We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem\, given a directed graph $G$\, pairs of vertices (called terminals) $(s_1\,t_1)$\, $(s_2\,t_2)$\, and $(s_3\,t_3)$\, and an integer $k$\, asks to find a set of at most $k$ non-terminal vertices in $G$ that intersect all $s_1t_1$-paths\, all $s_2t_2$-paths\, and all $s_3t_3$-paths. The parameterized complexity of this case has been open since Chitnis\, Cygan\, Hajiaghayi\, and Marx proved fixed-parameter tractability of the 2-terminal-pairs case at SODA 2012\, and Pilipczuk and Wahlström proved the W[1]-hardness of the 4-terminal-pairs case at SODA 2016. \nOn the technical side\, we use two recent developments in parameterized algorithms. Using the technique of directed flow-augmentation [Kim\, Kratsch\, Pilipczuk\, Wahlström\, STOC 2022] we cast the problem as a CSP problem with few variables and constraints over a large ordered domain. We observe that this problem can be in turn encoded as an FO model-checking task over a structure consisting of a few 0-1 matrices. We look at this problem through the lenses of twin-width\, a recently introduced structural parameter [Bonnet\, Kim\, Thomassé\, Watrigant\, FOCS 2020]: By a recent characterization [Bonnet\, Giocanti\, Ossona de Mendez\, Simon\, Thomassé\, Toruńczyk\, STOC 2022] the said FO model-checking task can be done in FPT time if the said matrices have bounded grid rank. To complete the proof\, we show an irrelevant vertex rule: If any of the matrices in the said encoding has a large grid minor\, a vertex corresponding to the “middle” box in the grid minor can be proclaimed irrelevant — not contained in the sought solution — and thus reduced.
URL:https://dimag.ibs.re.kr/event/2023-02-21/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230215T163000
DTEND;TZID=Asia/Seoul:20230215T173000
DTSTAMP:20260416T212247
CREATED:20230103T235641Z
LAST-MODIFIED:20240705T170041Z
UID:6623-1676478600-1676482200@dimag.ibs.re.kr
SUMMARY:Robert Hickingbotham\, Treewidth\, Circle Graphs and Circular Drawings
DESCRIPTION:A circle graph is an intersection graph of a set of chords of a circle. In this talk\, I will describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects’. Our results imply that treewidth and Hadwiger number are linearly tied on the class of circle graphs\, and that the unavoidable induced subgraphs of a vertex-minor-closed class with large treewidth are the usual suspects if and only if the class has bounded rank-width. I will also discuss applications of our results to the treewidth of graphs $G$ that have a circular drawing whose crossing graph is well-behaved in some way. In this setting\, our results show that if the crossing graph is $K_t$-minor-free\, then $G$ has treewidth at most $12t-23$ and has no $K_{2\,4t}$-topological minor. On the other hand\, I’ll present a construction of graphs with arbitrarily large Hadwiger number that have circular drawings whose crossing graphs are $2$-degenerate. This is joint work with Freddie Illingworth\, Bojan Mohar\, and David R. Wood
URL:https://dimag.ibs.re.kr/event/2023-02-15/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230214T163000
DTEND;TZID=Asia/Seoul:20230214T173000
DTSTAMP:20260416T212247
CREATED:20221122T113208Z
LAST-MODIFIED:20240705T171025Z
UID:6504-1676392200-1676395800@dimag.ibs.re.kr
SUMMARY:Raphael Steiner\, Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
DESCRIPTION:Hadwiger’s famous coloring conjecture states that every t-chromatic graph contains a $K_t$-minor. Holroyd [Bull. London Math. Soc. 29\, (1997)\, pp. 139-144] conjectured the following strengthening of Hadwiger’s conjecture: If G is a t-chromatic graph and S⊆V(G) takes all colors in every t-coloring of G\, then G contains a $K_t$-minor rooted at S. We prove this conjecture in the first open case of t=4. Notably\, our result also directly implies a stronger version of Hadwiger’s conjecture for 5-chromatic graphs as follows: Every 5-chromatic graph contains a $K_5$-minor with a singleton branch-set. In fact\, in a 5-vertex-critical graph we may specify the singleton branch-set to be any vertex of the graph. Joint work with Anders Martinsson (ETH).
URL:https://dimag.ibs.re.kr/event/2023-02-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230201T163000
DTEND;TZID=Asia/Seoul:20230201T173000
DTSTAMP:20260416T212247
CREATED:20230115T151551Z
LAST-MODIFIED:20240705T170041Z
UID:6664-1675269000-1675272600@dimag.ibs.re.kr
SUMMARY:Benjamin Bergougnoux\, Tight Lower Bounds for Problems Parameterized by Rank-width
DESCRIPTION:We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$\, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm given by Bui-Xuan\, Telle\, and Vatshelle [Discret. Appl. Math.\, 2010] and it answers the open question of Bergougnoux and Kanté [SIAM J. Discret. Math.\, 2021]. We also show that the known $2^{O(k^2)} n^{O(1)}$ time algorithms for Weighted Dominating Set\, Maximum Induced Matching and Feedback Vertex Set parameterized by rank-width $k$ are optimal assuming ETH. Our results are the first tight ETH lower bounds parameterized by rank-width that do not follow directly from lower bounds for $n$-vertex graphs. \nThis is a joint work with Tuukka Korhonen and Jesper Nederlof.\nAccepted to STACS 2023 and available on arXiv https://arxiv.org/abs/2210.02117
URL:https://dimag.ibs.re.kr/event/2023-02-01/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230131T163000
DTEND;TZID=Asia/Seoul:20230131T173000
DTSTAMP:20260416T212247
CREATED:20230110T062223Z
LAST-MODIFIED:20240707T074122Z
UID:6639-1675182600-1675186200@dimag.ibs.re.kr
SUMMARY:Abhishek Methuku\, A proof of the Erdős–Faber–Lovász conjecture
DESCRIPTION:The Erdős–Faber–Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on n vertices is at most n. In this talk\, I will sketch a proof of this conjecture for every large n. Joint work with D. Kang\, T. Kelly\, D. Kühn and D. Osthus.
URL:https://dimag.ibs.re.kr/event/2023-01-31/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230125T163000
DTEND;TZID=Asia/Seoul:20230125T173000
DTSTAMP:20260416T212247
CREATED:20221109T131052Z
LAST-MODIFIED:20240705T171112Z
UID:6458-1674664200-1674667800@dimag.ibs.re.kr
SUMMARY:Jan Hladký\, Invitation to graphons
DESCRIPTION:The first course in graph theory usually covers concepts such as matchings\, independent sets\, colourings\, and forbidden subgraphs. Around 2004\, Borgs\, Chayes\, Lovász\, Sós\, Szegedy\, and Vestergombi introduced a very fruitful limit perspective on graphs. The central objects of this theory\, so-called graphons\, are suitable measurable counterparts to graphs. In the talk\, I will outline the syllabus of a hypothetical first course in graphon theory\, in particular introducing versions of all the aforementioned concepts in the graphon setting. Based on work with Doležal\, Hu\, Máthé\, Piguet\, Rocha.
URL:https://dimag.ibs.re.kr/event/2023-01-25/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230119T100000
DTEND;TZID=Asia/Seoul:20230119T110000
DTSTAMP:20260416T212247
CREATED:20230103T142421Z
LAST-MODIFIED:20240705T170041Z
UID:6619-1674122400-1674126000@dimag.ibs.re.kr
SUMMARY:Pedro Montealegre\, A Meta-Theorem for Distributed Certification
DESCRIPTION:Distributed certification\, whether it be proof-labeling schemes\, locally checkable proofs\, etc.\, deals with the issue of certifying the legality of a distributed system with respect to a given boolean predicate. A certificate is assigned to each process in the system by a non-trustable oracle\, and the processes are in charge of verifying these certificates\, so that two properties are satisfied: completeness\, i.e.\, for every legal instance\, there is a certificate assignment leading all processes to accept\, and soundness\, i.e.\, for every illegal instance\, and for every certificate assignment\, at least one process rejects. The verification of the certificates must be fast\, and the certificates themselves must be small. \nA large quantity of results have been produced in this framework\, each aiming at designing a distributed certification mechanism for specific boolean predicates. In this talk\, I will present a “meta-theorem”\, applying to many boolean predicates at once. Specifically\, I will show that\, for every boolean predicate on graphs definable in the monadic second-order (MSO) logic of graphs\, there exists a distributed certification mechanism using certificates on $O(log^2 n)$ bits in n-node graphs of bounded treewidth\, with a verification protocol involving a single round of communication between neighbors.
URL:https://dimag.ibs.re.kr/event/2023-01-19/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230117T163000
DTEND;TZID=Asia/Seoul:20230117T173000
DTSTAMP:20260416T212247
CREATED:20221213T152329Z
LAST-MODIFIED:20240707T074134Z
UID:6556-1673973000-1673976600@dimag.ibs.re.kr
SUMMARY:Noleen Köhler\, Twin-Width VIII: Delineation and Win-Wins
DESCRIPTION:We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated by twin-width (or simply\, delineated) if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$\, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$ is monadically dependent. An effective strengthening of delineation for a class $\mathcal C$ implies that tractable FO model checking on $\mathcal C$ is perfectly understood: On hereditary closures of subclasses $\mathcal D$ of $\mathcal C$\, FO model checking on $\mathcal D$ is fixed-parameter tractable (FPT) exactly when $\mathcal D$ has bounded twin-width. Ordered graphs [BGOdMSTT\, STOC ’22] and permutation graphs [BKTW\, JACM ’22] are effectively delineated\, while subcubic graphs are not. On the one hand\, we prove that interval graphs\, and even\, rooted directed path graphs are delineated. On the other hand\, we observe or show that segment graphs\, directed path graphs (with arbitrarily many roots)\, and visibility graphs of simple polygons are not delineated. \nIn an effort to draw the delineation frontier between interval graphs (that are delineated) and axis-parallel two-lengthed segment graphs (that are not)\, we investigate the twin-width of restricted segment intersection classes. It was known that (triangle-free) pure axis-parallel unit segment graphs have unbounded twin-width [BGKTW\, SODA ’21]. We show that $K_{t\,t}$-free segment graphs\, and axis-parallel $H_t$-free unit segment graphs have bounded twin-width\, where $H_t$ is the half-graph or ladder of height $t$. In contrast\, axis-parallel $H_4$-free two-lengthed segment graphs have unbounded twin-width. We leave as an open question whether unit segment graphs are delineated. \nMore broadly\, we explore which structures (large bicliques\, half-graphs\, or independent sets) are responsible for making the twin-width large on the main classes of intersection and visibility graphs. Our new results\, combined with the FPT algorithm for first-order model checking on graphs given with $O(1)$-sequences [BKTW\, JACM ’22]\, give rise to a variety of algorithmic win-win arguments. They all fall in the same framework: If $p$ is an FO definable graph parameter that effectively functionally upperbounds twin-width on a class C\, then $p(G) \ge k$ can be decided in FPT time $f(k)\cdot |V (G)|O(1)$. For instance\, we readily derive FPT algorithms for k-Ladder on visibility graphs of 1.5D terrains\, and k-Independent Set on visibility graphs of simple polygons. This showcases that the theory of twin-width can serve outside of classes of bounded twin-width. \nJoint work with Édouard Bonnet\, Dibyayan Chakraborty\, Eun Jung Kim\, Raul Lopes and Stéphan Thomassé.
URL:https://dimag.ibs.re.kr/event/2023-01-17/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230110T163000
DTEND;TZID=Asia/Seoul:20230110T173000
DTSTAMP:20260416T212247
CREATED:20221123T222545Z
LAST-MODIFIED:20240705T171022Z
UID:6518-1673368200-1673371800@dimag.ibs.re.kr
SUMMARY:Mamadou Moustapha Kanté\, MSOL-Definable decompositions
DESCRIPTION:I will first introduce the notion of recognisability of languages of terms and then its extensions to sets of relational structures. In a second step\, I will discuss relations with decompositions of graphs/matroids and why their MSOL-definability is related to understanding recognisable sets. I will finally explain  how to define in MSOL branch-decompositions for finitely representable matroids of bounded path-width. This is joint work with Rutger Campbell\, Bruno Guillon\, Eun Jung Kim\, and Sang-il Oum.
URL:https://dimag.ibs.re.kr/event/2023-01-10/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230103T163000
DTEND;TZID=Asia/Seoul:20230103T173000
DTSTAMP:20260416T212247
CREATED:20221010T054006Z
LAST-MODIFIED:20240707T074146Z
UID:6280-1672763400-1672767000@dimag.ibs.re.kr
SUMMARY:Youngho Yoo (유영호)\, Approximating TSP walks in subcubic graphs
DESCRIPTION:The Graphic Travelling Salesman Problem is the problem of finding a spanning closed walk (a TSP walk) of minimum length in a given connected graph. The special case of the Graphic TSP on subcubic graphs has been studied extensively due to their worst-case behaviour in the famous $\frac{4}{3}$-integrality-gap conjecture on the “subtour elimination” linear programming relaxation of the Metric TSP. \nWe prove that every simple 2-connected subcubic graph on $n$ vertices with $n_2$ vertices of degree 2 has a TSP walk of length at most $\frac{5n+n_2}{4}-1$\, confirming a conjecture of Dvořák\, Král’\, and Mohar. This bound is best possible and we characterize the extremal subcubic examples meeting this bound. We also give a quadratic time combinatorial algorithm to find such a TSP walk. In particular\, we obtain a $\frac{5}{4}$-approximation algorithm for the Graphic TSP on cubic graphs. Joint work with Michael Wigal and Xingxing Yu.
URL:https://dimag.ibs.re.kr/event/2023-01-03/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20221228T163000
DTEND;TZID=Asia/Seoul:20221228T173000
DTSTAMP:20260416T212247
CREATED:20221221T082326Z
LAST-MODIFIED:20240705T170042Z
UID:6590-1672245000-1672248600@dimag.ibs.re.kr
SUMMARY:Stijn Cambie\, The 69-conjecture and more surprises on the number of independent sets
DESCRIPTION:Various types of independent sets have been studied for decades. As an example\, the minimum number of maximal independent sets in a connected graph of given order is easy to determine (hint; the answer is written in the stars). When considering this question for twin-free graphs\, it becomes less trivial and one discovers some surprising behaviour. The minimum number of maximal independent sets turns out to be; \n\nlogarithmic in the number of vertices for arbitrary graphs\,\nlinear for bipartite graphs\nand exponential for trees.\n\nFinally\, we also have a sneak peek on the 69-conjecture\, part of an unpublished work on an inverse problem on the number of independent sets. \nIn this talk\, we will focus on the basic concepts\, the intuition behind the statements and sketch some proof ideas. \nThe talk is based on joint work with Stephan Wagner\, with the main chunk being available at arXiv:2211.04357.
URL:https://dimag.ibs.re.kr/event/2022-12-28/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR