BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240729
DTEND;VALUE=DATE:20240803
DTSTAMP:20260416T054008
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;TZID=Asia/Seoul:20240730T163000
DTEND;TZID=Asia/Seoul:20240730T173000
DTSTAMP:20260416T054008
CREATED:20240417T003214Z
LAST-MODIFIED:20240705T153017Z
UID:8532-1722357000-1722360600@dimag.ibs.re.kr
SUMMARY:Euiwoong Lee (이의웅)\, Parameterized Approximability of F-Deletion Problems
DESCRIPTION:For a family F of graphs\, the F-Deletion Problem asks to remove the minimum number of vertices from a given graph G to ensure that G belongs to F. One of the most common ways to obtain an interesting family F is to fix another family H of graphs and let F be the set of graphs that do not contain any graph H as some notion of a subgraph\, including (standard) subgraph\, induced subgraph\, and minor. This framework captures numerous basic graph problems\, including Vertex Cover\, Feedback Vertex Set\, and Treewidth Deletion\, and provides an interesting forum where ideas from approximation and parameterized algorithms influence each other. In this talk\, I will give a brief survey on the state of the art on the F-Deletion Problems for the above three notions of subgraphs\, and talk about a recent result on Weighted Bond Deletion.
URL:https://dimag.ibs.re.kr/event/2024-07-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240806T163000
DTEND;TZID=Asia/Seoul:20240806T173000
DTSTAMP:20260416T054008
CREATED:20240530T224927Z
LAST-MODIFIED:20240710T060308Z
UID:8733-1722961800-1722965400@dimag.ibs.re.kr
SUMMARY:Daniel Král'\, Matroid depth and width parameters
DESCRIPTION:Depth and width parameters of graphs\, e.g.\, tree-width\, path-width and tree-depth\, play a crucial role in algorithmic and structural graph theory. These notions are of fundamental importance in the theory of graph minors\, fixed parameter complexity and the theory of sparsity. \nIn this talk\, we will survey structural and algorithmic results that concern width and depth parameters of matroids. We will particularly focus on matroid depth parameters and discuss the relation of the presented concepts to discrete optimization. As an application\, we will present matroid based algorithms that uncover a hidden Dantzig-Wolfe-like structure of an input instance (if such structure is present) and transform instances of integer programming to equivalent ones\, which are amenable to the existing tools in integer programming. \nThe most recent results presented in the talk are based on joint work with Marcin Briański\, Jacob Cooper\, Timothy F. N. Chan\, Martin Koutecký\, Ander Lamaison\, Kristýna Pekárková and Felix Schröder.
URL:https://dimag.ibs.re.kr/event/2024-08-06/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240813T163000
DTEND;TZID=Asia/Seoul:20240813T173000
DTSTAMP:20260416T054008
CREATED:20240621T071458Z
LAST-MODIFIED:20240726T000121Z
UID:8784-1723566600-1723570200@dimag.ibs.re.kr
SUMMARY:Peter Nelson\, Formalizing matroid theory in a proof assistant
DESCRIPTION:For the past few years\, I’ve been working on formalizing proofs in matroid theory using the Lean proof assistant. This has led me to many interesting and unexpected places. I’ll talk about what formalization looks like in practice from the perspective of a combinatorialist.
URL:https://dimag.ibs.re.kr/event/2024-08-13/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240819
DTEND;VALUE=DATE:20240824
DTSTAMP:20260416T054008
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;TZID=Asia/Seoul:20240827T163000
DTEND;TZID=Asia/Seoul:20240827T173000
DTSTAMP:20260416T054008
CREATED:20240530T224746Z
LAST-MODIFIED:20240729T124158Z
UID:8730-1724776200-1724779800@dimag.ibs.re.kr
SUMMARY:Dillon Mayhew\, Monadic second-order definability for gain-graphic matroids
DESCRIPTION:Every (finite) matroid consists of a (finite) set called the ground set\, and a collection of distinguished subsets called the independent sets. A classic example arises when the ground set is a finite set of vectors from a vector space\, and the independent subsets are exactly the subsets that are linearly independent. Any such matroid is said to be representable. We can think of a representable matroid as being a geometrical configuration where the points have been given coordinates from a field. Another important class arises when the points are given coordinates from a group. Such a class is said to be gain-graphic.  \nMonadic second-order logic is a natural language for matroid applications. In this language we are able to quantify only over subsets of the ground set. The importance of monadic second-order logic comes from its connections to the theory of computation\, as exemplified by Courcelle’s Theorem. This theorem provides polynomial-time algorithms for recognising properties defined in monadic second-order logic (as long as we impose a bound on the structural complexity of the input objects). It is natural to ask which classes of matroids can be defined by sentences in monadic second-order logic. When the class consists of the matroids that are coordinatized by a field we have a complete answer to this question. When the class is coordinatized by a group the problem becomes much harder. \nThis talk will contain a brief introduction to matroids. Based on work with Sapir Ben-Shahar\, Matt Conder\, Daryl Funk\, Angus Matthews\, Mike Newman\, and Gabriel Verret.
URL:https://dimag.ibs.re.kr/event/2024-08-27/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240828
DTEND;VALUE=DATE:20240831
DTSTAMP:20260416T054008
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:20240903T163000
DTEND;TZID=Asia/Seoul:20240903T173000
DTSTAMP:20260416T054008
CREATED:20240319T124710Z
LAST-MODIFIED:20240707T023848Z
UID:8360-1725381000-1725384600@dimag.ibs.re.kr
SUMMARY:Amadeus Reinald\, Oriented trees in $O(k \sqrt{k})$-chromatic digraphs\, a subquadratic bound for Burr's conjecture
DESCRIPTION:In 1980\, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices\, which was improved in 2013 to $\frac{k^2}{2} – \frac{k}{2} + 1$ by Addario-Berry et al. \nIn this talk\, we give the first subquadratic bound for Burr’s conjecture\, by showing that every directed graph with chromatic number $8\sqrt{\frac{2}{15}} k \sqrt{k} + O(k)$ contains any oriented tree of order $k$. Moreover\, we provide improved bounds of $\sqrt{\frac{4}{3}} k \sqrt{k}+O(k)$ for arborescences\, and $(b-1)(k-3)+3$ for paths on $b$ blocks\, with $b\ge 2$.
URL:https://dimag.ibs.re.kr/event/2024-09-03/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240906T163000
DTEND;TZID=Asia/Seoul:20240906T173000
DTSTAMP:20260416T054008
CREATED:20240619T001339Z
LAST-MODIFIED:20240707T023728Z
UID:8770-1725640200-1725643800@dimag.ibs.re.kr
SUMMARY:Neal Bushaw\, Edge-colored Extremal Problems
DESCRIPTION:An edge-colored graph $H$ is called rainbow if all of its edges are given distinct colors.  An edge-colored graph $G$ is then called rainbow $H$-free when no copy of $H$ in $G$ is rainbow.  With this\, we define a graph $G$ to be rainbow $H$-saturated when there is some proper edge-coloring of $G$ which is rainbow $H$-free\, but for every pair of non-adjacent vertices $x\,y\in V(G)$\, the graph $G+xy$ formed by adding the edge $xy$ to $G$ cannot be given a rainbow $H$-free coloring.  We think of these graphs as edge-maximal rainbow $H$-free graphs.  (We note that here we make no restrictions on the colorings of $G+xy$ whatsoever\, except that they are proper colorings.  They may use any number of colors\, and need not be extensions of the original rainbow $H$-free coloring of $G$.)\n\nWith this framework in place\, we define the rainbow saturation number and rainbow extremal number to be the largest and smallest number of edges\, respectively\, among all $n$ vertex rainbow $H$-saturated graphs.  The latter of these was defined by Keevash\, Mubayi\, Sudakov\, and Verstraëte in 2007; the former was introduced by B.\, Johnston\, and Rombach in 2019.\n\n In this talk\, we discuss recent progress on both the rainbow saturation numbers and rainbow extremal numbers.  We also give several broad generalizations of these concepts and discuss many open problems.  This talk contains joint work with Vic Bednar (Furman)\, Dan Johnston (Trinity College\, CT)\, and Puck Rombach (Vermont).
URL:https://dimag.ibs.re.kr/event/2024-09-06/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240910T163000
DTEND;TZID=Asia/Seoul:20240910T173000
DTSTAMP:20260416T054008
CREATED:20240807T055137Z
LAST-MODIFIED:20240807T083739Z
UID:9690-1725985800-1725989400@dimag.ibs.re.kr
SUMMARY:Zhihan Jin (金之涵)\, The Helly number of Hamming balls and related problems
DESCRIPTION:We prove the following variant of Helly’s classical theorem for Hamming balls with a bounded radius. For $n > t$ and any (finite or infinite) set $X$\, if in a family of Hamming balls of radius $t$ in $X$\, every subfamily of at most $2^{t+1}$ balls have a common point\, so do all members of the family. This is tight for all $|X| > 1$ and all $n > t$. The proof of the main result is based on a novel variant of the so-called dimension argument\, which allows one to prove upper bounds that do not depend on the dimension of the ambient space. We also discuss several related questions and connections to problems and results in extremal finite set theory and graph theory. This is joint work with N. Alon and B. Sudakov.
URL:https://dimag.ibs.re.kr/event/2024-09-10/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240924T163000
DTEND;TZID=Asia/Seoul:20240924T173000
DTSTAMP:20260416T054008
CREATED:20240721T112741Z
LAST-MODIFIED:20240913T040647Z
UID:9602-1727195400-1727199000@dimag.ibs.re.kr
SUMMARY:Gábor Tardos\, Extremal theory of 0-1 matrices
DESCRIPTION:We say that a 0-1 matrix A contains another such matrix (pattern) P if P can be obtained from a submatrix of A by possibly changing a few 1 entries to 0. The main question of this theory is to estimate the maximal number of 1 entries in an n by n 0-1 matrix NOT containing a given pattern P. This question has very close connections to Turan type extremal graph theory and also to the Devenport-Schinzel theory of sequences. Results in the extremal theory of 0-1 matrices proved useful in attacking problems in far away fields as combinatorial geometry and the analysis of algorithms. \nThis talk will concentrate on acyclic patterns and survey some old and recent results in the area and will also contain several open problems.
URL:https://dimag.ibs.re.kr/event/2024-09-24/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241008T163000
DTEND;TZID=Asia/Seoul:20241008T173000
DTSTAMP:20260416T054008
CREATED:20240815T140405Z
LAST-MODIFIED:20240815T140630Z
UID:9708-1728405000-1728408600@dimag.ibs.re.kr
SUMMARY:Mathias Schacht\, Canonical colourings in random graphs
DESCRIPTION:Rödl and Ruciński established Ramsey’s theorem for random graphs. In particular\, for fixed integers $r$\, $\ell\geq 2$ they showed that $n^{-\frac{2}{\ell+1}}$ is a threshold for the Ramsey property that every $r$-colouring of the edges of the binomial random graph $G(n\,p)$ yields a monochromatic copy of $K_\ell$. \nWe investigate how this result extends to arbitrary colourings of $G(n\,p)$ with an unbounded number of colours. In this situation Erdős and Rado showed that canonically coloured copies of $K_\ell$ can be ensured in the deterministic setting.\nWe transfer the Erdős-Rado theorem to the random environment and show that for $\ell\geq 4$ both thresholds coincide. As a consequence the proof yields $K_{\ell+1}$-free graphs $G$ for which every edge colouring yields a canonically coloured $K_\ell$. \nThis is joint work with Nina Kamčev.
URL:https://dimag.ibs.re.kr/event/2024-10-08/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241015T163000
DTEND;TZID=Asia/Seoul:20241015T173000
DTSTAMP:20260416T054008
CREATED:20240728T055631Z
LAST-MODIFIED:20240815T135958Z
UID:9631-1729009800-1729013400@dimag.ibs.re.kr
SUMMARY:Kyeongsik Nam (남경식)\, Random walks on percolation
DESCRIPTION:In general\, random walks on fractal graphs are expected to exhibit anomalous behaviors\, for example heat kernel is significantly different from that in the case of lattices. Alexander and Orbach in 1982 conjectured that random walks on critical percolation\, a prominent example of fractal graphs\, exhibit mean field behavior; for instance\, its spectral dimension is 4/3. In this talk\, I will talk about this conjecture for a canonical dependent percolation model.
URL:https://dimag.ibs.re.kr/event/2024-10-15/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241022T163000
DTEND;TZID=Asia/Seoul:20241022T173000
DTSTAMP:20260416T054008
CREATED:20240905T081105Z
LAST-MODIFIED:20240913T030403Z
UID:9850-1729614600-1729618200@dimag.ibs.re.kr
SUMMARY:Colin Geniet\, Permutations\, patterns\, and twin-width
DESCRIPTION:This talk will first introduce combinatorics on permutations and patterns\, presenting the basic notions and some fundamental results: the Marcus-Tardos theorem which bounds the density of matrices avoiding a given pattern\, and the Guillemot-Marx algorithm for pattern detection using the notion now known as twin-width. \nI will then present a decomposition result: permutations avoiding a pattern factor into bounded products of separable permutations. This can be rephrased in terms of twin-width: permutation with bounded twin-width are build from a bounded product of permutations of twin-width 0. Comparable results on graph encodings follow from this factorisation. \nThis is joint work with Édouard Bonnet\, Romain Bourneuf\, and Stéphan Thomassé.
URL:https://dimag.ibs.re.kr/event/2024-10-22/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241029T163000
DTEND;TZID=Asia/Seoul:20241029T173000
DTSTAMP:20260416T054008
CREATED:20240919T043705Z
LAST-MODIFIED:20240919T043705Z
UID:9894-1730219400-1730223000@dimag.ibs.re.kr
SUMMARY:Felix Christian Clemen\, Triangles in the Plane
DESCRIPTION:A classical problem in combinatorial geometry\, posed by Erdős in 1946\, asks to determine the maximum number of unit segments in a set of $n$ points in the plane. Since then a great variety of extremal problems in finite planar point sets have been studied. Here\, we look at such questions concerning triangles. Among others we answer the following question asked by Erdős and Purdy almost 50 years ago: Given $n$ points in the plane\, how many triangles can be approximate congruent to equilateral triangles? \nFor our proofs we use hypergraph Turán theory. This is joint work with Balogh and Dumitrescu.
URL:https://dimag.ibs.re.kr/event/2024-10-29/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241105T163000
DTEND;TZID=Asia/Seoul:20241105T173000
DTSTAMP:20260416T054008
CREATED:20240718T042813Z
LAST-MODIFIED:20241022T011746Z
UID:9550-1730824200-1730827800@dimag.ibs.re.kr
SUMMARY:Michał Pilipczuk\, Monadic stability and monadic dependence
DESCRIPTION:We will give an overview of the recent attempts of building a structure theory for graphs centered around First-Order transductions: a notion of containment inspired by finite model theory. Particularly\, we will speak about the notions of monadic dependence and monadic stability\, their combinatorial characterizations\, and the developments on the algorithmic front.
URL:https://dimag.ibs.re.kr/event/2024-11-05/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241111T110000
DTEND;TZID=Asia/Seoul:20241111T173000
DTSTAMP:20260416T054008
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;TZID=Asia/Seoul:20241112T163000
DTEND;TZID=Asia/Seoul:20241112T173000
DTSTAMP:20260416T054008
CREATED:20240831T051640Z
LAST-MODIFIED:20240917T095446Z
UID:9815-1731429000-1731432600@dimag.ibs.re.kr
SUMMARY:Karim Adiprasito\, Ehrhart theory revisited: Algebraic aspects\, unimodality and more
DESCRIPTION:Ehrhart theory is the study of lattice polytopes\, specifically aimed at understanding how many lattice points are inside dilates of a given lattice polytope\, and the study has a wide range of connections ranging from coloring graphs to mirror symmetry and representation theory. Recently\, we introduced new algebraic tools to understand this theory\, and resolve some classical conjectures. I will explain the combinatorial underpinnings behind two of the key techniques: Parseval identities for semigroup algebras\, and the character algebra of a semigroup.
URL:https://dimag.ibs.re.kr/event/2024-11-12/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241126T163000
DTEND;TZID=Asia/Seoul:20241126T173000
DTSTAMP:20260416T054008
CREATED:20241018T131301Z
LAST-MODIFIED:20241018T132054Z
UID:9992-1732638600-1732642200@dimag.ibs.re.kr
SUMMARY:Eng Keat Hng\, Graphon branching processes and fractional isomorphism
DESCRIPTION:In 2005\, Bollobás\, Janson and Riordan introduced and extensively studied a general model of inhomogeneous random graphs parametrised by graphons. In particular\, they studied the emergence of a giant component in these inhomogeneous random graphs by relating them to a broad collection of inhomogeneous Galton-Watson branching processes. \nFractional isomorphism of finite graphs is an important and well-studied concept at the intersection of graph theory and combinatorial optimisation. It has many different characterizations that involve a range of very different and seemingly unrelated properties of graphs. Recently\, Grebík and Rocha developed a theory of fractional isomorphism for graphons. \nIn our work\, we characterise inhomogeneous random graphs that yield the same inhomogeneous Galton-Watson branching process (and hence have a similar component structure). \nThis is joint work with Jan Hladký and Anna Margarethe Limbach.
URL:https://dimag.ibs.re.kr/event/2024-11-26/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241203T163000
DTEND;TZID=Asia/Seoul:20241203T173000
DTSTAMP:20260416T054008
CREATED:20241031T064935Z
LAST-MODIFIED:20241031T065407Z
UID:10022-1733243400-1733247000@dimag.ibs.re.kr
SUMMARY:Yulai Ma\, Pairwise disjoint perfect matchings in regular graphs
DESCRIPTION:An $r$-graph is an $r$-regular graph in which every odd set of vertices is connected to its complement by at least $r$ edges. A central question regarding $r$-graphs is determining the maximum number of pairwise disjoint perfect matchings they can contain. This talk explores how edge connectivity influences this parameter. \nFor ${0 \leq \lambda \leq r}$\, let $m(\lambda\,r)$ denote the maximum number $s$ such that every $\lambda$-edge-connected $r$-graph contains $s$ pairwise disjoint perfect matchings. The values of $m(\lambda\,r)$ are known only in limited cases; for example\, $m(3\,3)=m(4\,r)=1$\, and $m(r\,r) \leq r-2$ for all $r \not = 5$\, with $m(r\,r) \leq r-3$ when $r$ is a multiple of $4$. In this talk\, we present new upper bounds for $m(\lambda\,r)$ and examine connections between $m(5\,5)$ and several well-known conjectures for cubic graphs. \nThis is joint work with Davide Mattiolo\, Eckhard Steffen\, and Isaak H. Wolf.
URL:https://dimag.ibs.re.kr/event/2024-12-03/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241213T163000
DTEND;TZID=Asia/Seoul:20241213T173000
DTSTAMP:20260416T054008
CREATED:20241115T050831Z
LAST-MODIFIED:20241116T074247Z
UID:10175-1734107400-1734111000@dimag.ibs.re.kr
SUMMARY:Jun Gao (高峻)\, Phase transition of degenerate Turán problems in p-norms
DESCRIPTION:For a positive real number $p$\, the $p$-norm $\|G\|_p$ of a graph $G$ is the sum of the $p$-th powers of all vertex degrees. We study the maximum $p$-norm $\mathrm{ex}_{p}(n\,F)$ of $F$-free graphs on $n$ vertices\, focusing on the case where $F$ is a bipartite graph. It is natural to conjecture that for every bipartite graph $F$\, there exists a threshold $p_F$ such that for $p< p_{F}$\, the order of $\mathrm{ex}_{p}(n\,F)$ is governed by pseudorandom constructions\, while for $p > p_{F}$\, it is governed by star-like constructions. We determine the exact value of $p_{F}$\, under a mild assumption on the growth rate of $\mathrm{ex}(n\,F)$. Our results extend to $r$-uniform hypergraphs as well. \nWe also prove a general upper bound that is tight up to a $\log n$ factor for $\mathrm{ex}_{p}(n\,F)$ when $p = p_{F}$.\nWe conjecture that this $\log n$ factor is unnecessary and prove this conjecture for several classes of well-studied bipartite graphs\, including one-side degree-bounded graphs and families of short even cycles. \nThis is a joint work with Xizhi Liu\, Jie Ma and Oleg Pikhurko.
URL:https://dimag.ibs.re.kr/event/2024-12-13/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241217T163000
DTEND;TZID=Asia/Seoul:20241217T173000
DTSTAMP:20260416T054008
CREATED:20241115T062835Z
LAST-MODIFIED:20241115T064748Z
UID:10177-1734453000-1734456600@dimag.ibs.re.kr
SUMMARY:Joonkyung Lee (이준경)\, Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials
DESCRIPTION:An edge-weighted graph $G$\, possibly with loops\, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue\, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an antiferromagnetic graph $G$ generalises various important parameters in graph theory\, including the number of independent sets and proper vertex colourings. \nWe obtain a number of new homomorphism inequalities for antiferromagnetic target graphs $G$. In particular\, we prove that\, for any antiferromagnetic $G$\, \n$|\mathrm{Hom}(K_d\, G)|^{1/d} ≤ |\mathrm{Hom}(K_{d\,d} \setminus M\, G)|^{1/(2d)}$ \nholds\, where $K_{d\,d} \setminus M$ denotes the complete bipartite graph $K_{d\,d}$ minus a perfect matching $M$. This confirms a conjecture of Sah\, Sawhney\, Stoner and Zhao for complete graphs $K_d$. Our method uses the emerging theory of Lorentzian polynomials due to Brändén and Huh\, which may be of independent interest. \nJoint work with Jaeseong Oh and Jaehyeon Seo.
URL:https://dimag.ibs.re.kr/event/2024-12-17/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241223T163000
DTEND;TZID=Asia/Seoul:20241223T173000
DTSTAMP:20260416T054008
CREATED:20241115T065846Z
LAST-MODIFIED:20241214T083034Z
UID:10184-1734971400-1734975000@dimag.ibs.re.kr
SUMMARY:Zixiang Xu (徐子翔)\, Multilinear polynomial methods and stability results on set systems
DESCRIPTION:In 1966\, Kleitman established that if \( |A \triangle B| \leq d \) for any \( A\, B \in \mathcal{F} \)\, then \( |\mathcal{F}| \leq \sum_{i=0}^{k} \binom{n}{i} \) for \( d = 2k \)\, and \( |\mathcal{F}| \leq 2 \sum_{i=0}^{k} \binom{n-1}{i} \) for \( d = 2k+1 \). These upper bounds are attained by the radius-\(k\) Hamming ball \( \mathcal{K}(n\, k) := \{ F : F \subseteq [n]\, |F| \leq k \} \) in the even case\, and by the family \( \mathcal{K}_y(n\, k) := \{ F : F \subseteq [n]\, |F \setminus \{y\}| \leq k \} \) in the odd case. In 2017\, Frankl provided a combinatorial proof of a stability result for Kleitman’s theorem\, offering improved upper bounds for \( |\mathcal{F}| \) when \( \mathcal{F} \) is not the extremal structure. \nIn this talk\, I will begin by demonstrating the application of multilinear polynomial methods in extremal set theory\, highlighting some interesting techniques. I will then present an algebraic proof of the stability result for Kleitman’s theorem. Finally\, I will discuss further applications and explore how to employ linear algebra methods more effectively and flexibly. \nThis talk is based on joint work with Jun Gao and Hong Liu.
URL:https://dimag.ibs.re.kr/event/2024-12-23/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250103T163000
DTEND;TZID=Asia/Seoul:20250103T173000
DTSTAMP:20260416T054008
CREATED:20241119T145133Z
LAST-MODIFIED:20241204T064732Z
UID:10203-1735921800-1735925400@dimag.ibs.re.kr
SUMMARY:Huy Tuan Pham\, Random Cayley graphs and Additive combinatorics without groups
DESCRIPTION:A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman’s celebrated theorem first provided a structural characterization of sets with small doubling over the integers\, and subsequently Ruzsa in 1999 proved an analog for abelian groups with bounded exponent. Ruzsa further conjectured the correct quantitative dependence on the doubling K in his structural result\, which has attracted several interesting developments over the next two decades. I will discuss a complete resolution of (a strengthening of) Ruzsa’s conjecture. \nSurprisingly\, our approach is crucially motivated by purely graph-theoretic insights\, where we find that the group structure is superfluous and can be replaced by much more general combinatorial structures. Using this general approach\, we also obtain combinatorial and nonabelian generalizations of classical results in additive combinatorics\, and solve longstanding open problems around Cayley graphs and random Cayley graphs motivated by Ramsey theory\, information theory and computer science. \nBased on joint work with David Conlon\, Jacob Fox and Liana Yepremyan.
URL:https://dimag.ibs.re.kr/event/2025-01-03/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250114T163000
DTEND;TZID=Asia/Seoul:20250114T173000
DTSTAMP:20260416T054008
CREATED:20241226T072931Z
LAST-MODIFIED:20241230T145546Z
UID:10322-1736872200-1736875800@dimag.ibs.re.kr
SUMMARY:Tony Huynh\, The Peaceable Queens Problem
DESCRIPTION:The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ chessboard so that no queen can capture any queen of the opposite color. \nWe consider the peaceable queens problem and its variant on the toroidal board.  For the regular board\, we show that $a(n) \leq 0.1716n^2$\, for all sufficiently large $n$.  This improves on the bound $a(n) \leq 0.25n^2$ of van Bommel and MacEachern. \nFor the toroidal board\, we provide new upper and lower bounds.  Somewhat surprisingly\, our bounds show that there is a sharp contrast in behaviour between the odd torus and the even torus.  Our lower bounds are given by explicit constructions.  For the upper bounds\, we formulate the problem as a non-linear optimization problem with at most 100 variables\, regardless of the size of the board. We solve our non-linear program exactly using modern optimization software. \nWe also provide a local search algorithm and a software implementation which converges very rapidly to solutions which appear optimal.  Our algorithm is sufficiently robust that it works on both the regular and toroidal boards.  For example\, for the regular board\, the algorithm quickly finds the so-called Ainley construction. \nThis is joint work with Katie Clinch\, Matthew Drescher\, and Abdallah Saffidine.
URL:https://dimag.ibs.re.kr/event/2025-01-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250121T163000
DTEND;TZID=Asia/Seoul:20250121T173000
DTSTAMP:20260416T054008
CREATED:20241213T151545Z
LAST-MODIFIED:20241213T151545Z
UID:10270-1737477000-1737480600@dimag.ibs.re.kr
SUMMARY:Laure Morelle\, Bounded size modifications in time $2^{{\sf poly}(k)}\cdot n^2$
DESCRIPTION:A replacement action is a function $\mathcal L$ that maps each graph to a collection of subgraphs of smaller size. \nGiven a graph class $\mathcal H$\, we consider a general family of graph modification problems\, called “$\mathcal L$-Replacement to $\mathcal H$”\, where the input is a graph $G$ and the question is whether it is possible to replace some induced subgraph $H_1$ of $G$ on at most $k$ vertices by a graph $H_2$ in ${\mathcal L}(H_1)$ so that the resulting graph belongs to $\mathcal H$. \n“$\mathcal L$-Replacement to $\mathcal H$” can simulate many graph modification problems including vertex deletion\, edge deletion/addition/edition/contraction\, vertex identification\, subgraph complementation\, independent set deletion\, (induced) matching deletion/contraction\, etc. \nWe prove here that\, for any minor-closed graph class $\mathcal H$ and for any action $\mathcal L$ that is hereditary\, there is an algorithm that solves “$\mathcal L$-Replacement to $\mathcal H$” in time $2^{{\sf poly}(k)}\cdot |V(G)|^2$\, where $\sf poly$ is a polynomial whose degree depends on $\mathcal H$.
URL:https://dimag.ibs.re.kr/event/2025-01-21/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250203
DTEND;VALUE=DATE:20250206
DTSTAMP:20260416T054008
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;TZID=Asia/Seoul:20250204T163000
DTEND;TZID=Asia/Seoul:20250204T173000
DTSTAMP:20260416T054008
CREATED:20241226T073135Z
LAST-MODIFIED:20241230T024913Z
UID:10324-1738686600-1738690200@dimag.ibs.re.kr
SUMMARY:Jang Soo Kim (김장수)\, Longest elements in a semigroup of functions and Slater indices
DESCRIPTION:The group \( S_n \) of permutations on \([n]=\{1\,2\,\dots\,n\} \) is generated by simple transpositions \( s_i = (i\,i+1) \). The length \( \ell(\pi) \) of a permutation \( \pi \) is defined to be the minimum number of generators whose product is \( \pi \). It is well-known that the longest element in \( S_n \) has length \( n(n-1)/2 \). Let \( F_n \) be the semigroup of functions \( f:[n]\to[n] \)\, which are generated by the simple transpositions \( s_i \) and the function \( t:[n]\to[n] \) given by \( t(1) =t(2) = 1 \) and \( t(i) = i \) for \( i\ge3 \). The length \( \ell(f) \) of a function \( f\in F_n \) is defined to be the minimum number of these generators whose product is \( f \). In this talk\, we study the length of longest elements in \( F_n \). We also find a connection with the Slater index of a tournament of the\ncomplete graph \( K_n \). This is joint work with Yasuhide Numata.
URL:https://dimag.ibs.re.kr/event/2025-02-04/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250210
DTEND;VALUE=DATE:20250213
DTSTAMP:20260416T054008
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;TZID=Asia/Seoul:20250211T163000
DTEND;TZID=Asia/Seoul:20250211T173000
DTSTAMP:20260416T054008
CREATED:20241226T073216Z
LAST-MODIFIED:20250119T115501Z
UID:10327-1739291400-1739295000@dimag.ibs.re.kr
SUMMARY:Jungho Ahn (안정호)\, A coarse Erdős-Pósa theorem for constrained cycles
DESCRIPTION:An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem shows that for every positive integer $k$\, every graph contains $k$ vertex-disjoint cycles or a set of $O(k\log k)$ vertices which intersects every cycle of $G$. \nWe generalise this classic Erdős-Pósa theorem to induced packings of cycles of length at least $\ell$ for any integer $\ell$. We show that there exists a function $f(k\,\ell)=O(\ell k\log k)$ such that for all positive integers $k$ and $\ell$ with $\ell\geq3$\, every graph $G$ contains an induced packing of $k$ cycles of length at least $\ell$ or a set $X$ of at most $f(k\,\ell)$ vertices such that the closed neighbourhood of $X$ intersects every cycle of $G$. \nFurthermore\, we extend the result to long cycles containing prescribed vertices. For a graph $G$ and a set $S\subseteq V(G)$\, an $S$-cycle in $G$ is a cycle containing a vertex in $S$. We show that for all positive integers $k$ and $\ell$ with $\ell\geq3$\, every graph $G$\, and every set $S\subseteq V(G)$\, $G$ contains an induced packing of $k$ $S$-cycles of length at least $\ell$ or a set $X$ of at most $\ell k^{O(1)}$ vertices such that the closed neighbourhood of $X$ intersects every cycle of $G$. \nOur proofs are constructive and yield polynomial-time algorithms\, for fixed $\ell$\, finding either the induced packing of the constrained cycles or the set $X$. \nThis is based on joint works with Pascal Gollin\, Tony Huynh\, and O-joung Kwon.
URL:https://dimag.ibs.re.kr/event/2025-02-11/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR