BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.2.8.2//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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220104T163000
DTEND;TZID=Asia/Seoul:20220104T173000
DTSTAMP:20231211T212420
CREATED:20211210T230406Z
LAST-MODIFIED:20211210T230406Z
UID:5000-1641313800-1641317400@dimag.ibs.re.kr
SUMMARY:Seunghun Lee (이승훈)\, Transversals and colorings of simplicial spheres
DESCRIPTION:Motivated from the surrounding property of a point set in $\mathbb{R}^d$ introduced by Holmsen\, Pach and Tverberg\, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the maximum transversal ratio of simplicial $d$-spheres\, we provide two infinite constructions. The first construction gives infinitely many $(d+1)$-dimensional simplicial polytopes with the transversal ratio exactly $\frac{2}{d+2}$ for every $d\geq 2$. In the case of $d=2$\, this meets the previously well-known upper bound $1/2$ tightly. The second gives infinitely many simplicial 3-spheres with the transversal ratio greater than $1/2$. This was unexpected from what was previously known about the surrounding property. Moreover\, we show that\, for $d\geq 3$\, the facet hypergraph $\mathcal{F}(\mathbf{P})$ of a $(d+1)$-dimensional simplicial polytope $\mathbf{P}$ has the chromatic number $\chi(\mathcal{F}(\mathbf{P})) \in O(n^{\frac{\lceil d/2\rceil-1}{d}})$\, where $n$ is the number of vertices of $\mathbf{P}$. This slightly improves the upper bound previously obtained by Heise\, Panagiotou\, Pikhurko\, and Taraz. This is a joint work with Joseph Briggs and Michael Gene Dobbins.
URL:https://dimag.ibs.re.kr/event/2022-01-04/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220111T163000
DTEND;TZID=Asia/Seoul:20220111T173000
DTSTAMP:20231211T212421
CREATED:20220111T073000Z
LAST-MODIFIED:20211231T123601Z
UID:5083-1641918600-1641922200@dimag.ibs.re.kr
SUMMARY:Andreas Holmsen\, Some recent results on geometric transversals
DESCRIPTION:A geometric transversal to a family of convex sets in $\mathbb R^d$ is an affine flat that intersects the members of the family. While there exists a far-reaching theory concerning 0-dimensional transversals (intersection patterns of convex sets)\, much less is known when it comes to higher-dimensional transversals. In this talk\, I will present some new and old results and problems regarding geometric transversals\, based on joint work with Otfried Cheong and Xavier Goaoc.
URL:https://dimag.ibs.re.kr/event/2022-01-11/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220118T163000
DTEND;TZID=Asia/Seoul:20220118T173000
DTSTAMP:20231211T212421
CREATED:20220118T073000Z
LAST-MODIFIED:20220109T234836Z
UID:5105-1642523400-1642527000@dimag.ibs.re.kr
SUMMARY:Jaehyeon Seo (서재현)\, A rainbow Turán problem for color-critical graphs
DESCRIPTION:For given $k$ graphs $G_1\,\dots\, G_k$ over a common vertex set of size $n$\, what conditions on $G_i$ ensures a ‘colorful’ copy of $H$\, i.e. a copy of $H$ containing at most one edge from each $G_i$? \nKeevash\, Saks\, Sudakov\, and Verstraëte defined $\operatorname{ex}_k(n\,H)$ to be the maximum total number of edges of the graphs $G_1\,\dots\, G_k$ on a common vertex set of size $n$ having no colorful copy of $H$. They completely determined $\operatorname{ex}_k(n\,K_r)$ for large $n$ by showing that\, depending on the value of $k$\, one of the two natural constructions is always the extremal construction. Moreover\, they conjectured the same holds for every color-critical graphs and proved it for $3$-color-critical graphs. \nWe prove their conjecture for $4$-color-critical graphs and for almost all $r$-color-critical graphs when $r > 4$. Moreover\, we show that for every non-color-critical non-bipartite graphs\, none of the two natural constructions is extremal for certain values of $k$. This is a joint work with Debsoumya Chakraborti\, Jaehoon Kim\, Hyunwoo Lee\, and Hong Liu.
URL:https://dimag.ibs.re.kr/event/2022-01-18/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220125T163000
DTEND;TZID=Asia/Seoul:20220125T173000
DTSTAMP:20231211T212421
CREATED:20220125T073000Z
LAST-MODIFIED:20220114T044711Z
UID:5129-1643128200-1643131800@dimag.ibs.re.kr
SUMMARY:O-joung Kwon (권오정)\, Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
DESCRIPTION:In a reduction sequence of a graph\, vertices are successively identified until the graph has one vertex. At each step\, when identifying $u$ and $v$\, each edge incident to exactly one of $u$ and $v$ is coloured red. Bonnet\, Kim\, Thomassé\, and Watrigant [FOCS 2020] defined the twin-width of a graph $G$ to be the minimum integer $k$ such that there is a reduction sequence of $G$ in which every red graph has maximum degree at most $k$. For any graph parameter $f$\, we define the reduced-$f$ of a graph $G$ to be the minimum integer $k$ such that there is a reduction sequence of $G$ in which every red graph has $f$ at most $k$. Our focus is on graph classes with bounded reduced-bandwidth\, which implies and is stronger than bounded twin-width (reduced-maximum-degree). \nWe show that every proper minor-closed class has bounded reduced-bandwidth\, which is qualitatively stronger than a result of Bonnet et al. for bounded twin-width. In many instances\, we also make quantitative improvements. For example\, all previous upper bounds on the twin-width of planar graphs were at least $2^{1000}$. We show that planar graphs have reduced-bandwidth at most $466$ and twin-width at most $583$; moreover\, the witnessing reduction sequence can be constructed in polynomial time. We show that $d$-powers of graphs in a proper minor-closed class have bounded reduced-bandwidth (irrespective of the degree of the vertices). \nThis is joint work with Édouard bonnet and David Wood.
URL:https://dimag.ibs.re.kr/event/2022-01-25/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220208T163000
DTEND;TZID=Asia/Seoul:20220208T173000
DTSTAMP:20231211T212421
CREATED:20220208T073000Z
LAST-MODIFIED:20220126T085511Z
UID:5159-1644337800-1644341400@dimag.ibs.re.kr
SUMMARY:Pascal Gollin\, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
DESCRIPTION:Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. We therefore say that cycles satisfy the Erdős-Pósa property. However\, while odd cycles do not satisfy the Erdős-Pósa property\, Reed proved in 1999 an analogue by relaxing packing to half-integral packing\, where each vertex is allowed to be contained in at most two such cycles. Moreover\, he gave a structural characterisation for when the Erdős-Pósa property for odd cycles fails. \nWe prove a far-reaching generalisation of the theorem of Reed; if the edges of a graph are labelled by finitely many abelian groups\, then the cycles whose values avoid a fixed finite set for each abelian group satisfy the half-integral Erdős-Pósa property\, and we similarly give a structural characterisation for the failure of the Erdős-Pósa property. \nA multitude of natural properties of cycles can be encoded in this setting. For example\, we show that the cycles of length $\ell$ modulo $m$ satisfy the half-integral Erdős-Pósa property\, and we characterise for which values of $\ell$ and $m$ these cycles satisfy the Erdős-Pósa property. \nThis is joint work with Kevin Hendrey\, Ken-ichi Kawarabayashi\, O-joung Kwon\, Sang-il Oum\, and Youngho Yoo.
URL:https://dimag.ibs.re.kr/event/2022-02-08/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220215T163000
DTEND;TZID=Asia/Seoul:20220215T173000
DTSTAMP:20231211T212421
CREATED:20220215T073000Z
LAST-MODIFIED:20220213T013932Z
UID:5212-1644942600-1644946200@dimag.ibs.re.kr
SUMMARY:Jinha Kim (김진하)\, Independent domination of graphs with bounded maximum degree
DESCRIPTION:An independent dominating set of a graph\, also known as a maximal independent set\, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or $\Delta\ge 6$\, every connected $n$-vertex graph of maximum degree at most $\Delta$ has an independent dominating set of size at most $(1-\frac{\Delta}{ \lfloor\Delta^2/4\rfloor+\Delta })(n-1)+1$. In addition\, we characterize all connected graphs having the equality and we show that other connected graphs have an independent dominating set of size at most $(1-\frac{\Delta}{ \lfloor\Delta^2/4\rfloor+\Delta })n$.\nThis is joint work with Eun-Kyung Cho\, Minki Kim\, and Sang-il Oum.
URL:https://dimag.ibs.re.kr/event/2022-02-15/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220221T163000
DTEND;TZID=Asia/Seoul:20220221T173000
DTSTAMP:20231211T212421
CREATED:20220221T073000Z
LAST-MODIFIED:20220214T065551Z
UID:5216-1645461000-1645464600@dimag.ibs.re.kr
SUMMARY:Donggyu Kim (김동규)\, A stronger version of Tutte's wheel theorem for vertex-minors
DESCRIPTION:Tutte (1961) proved that every simple $3$-connected graph $G$ has an edge $e$ such that $G \setminus e$ or $G / e$ is simple $3$-connected\, unless $G$ is isomorphic to a wheel. We call such an edge non-essential. Oxley and Wu (2000) proved that every simple $3$-connected graph has at least $2$ non-essential edges unless it is isomorphic to a wheel. Moreover\, they proved that every simple $3$-connected graph has at least $3$ non-essential edges if and only if it is isomorphic to neither a twisted wheel nor a $k$-dimensional wheel with $k\geq2$. \nWe prove analogous results for graphs with vertex-minors. For a vertex $v$ of a graph $G$\, let $G*v$ be the graph obtained from $G$ by deleting all edges joining two neighbors of $v$ and adding edges joining non-adjacent pairs of two neighbors of $v$. This operation is called the local complementation at $v$\, and we say two graphs are locally equivalent if one can be obtained from the other by applying a sequence of local complementations. A graph $H$ is a vertex-minor of a graph $G$ if $H$ is an induced subgraph of a graph locally equivalent to $G$. A split of a graph is a partition $(A\,B)$ of its vertex set such that $|A|\,|B| \geq 2$ and for some $A’\subseteq A$ and $B’\subseteq B$\, two vertices $x\in A$ and $y\in B$ are adjacent if and only if $x\in A’$ and $y\in B’$. A graph is prime if it has no split. \nA vertex $v$ of a graph is non-essential if at least two of three kinds of vertex-minor reductions at $v$ result in prime graphs. We prove that every prime graph with at least $5$ vertices has at least two non-essential vertices unless it is locally equivalent to a cycle. It is stronger than a theorem proved by Allys (1994)\, which states that every prime graph with at least $5$ vertices has a non-essential vertex unless it is locally equivalent to a cycle. As a corollary of our result\, one can obtain the first result of Oxley and Wu. Furthermore\, we show that every prime graph with at least $5$ vertices has at least $3$ non-essential vertices if and only if it is not locally equivalent to a graph with two specified vertices $x$ and $y$ consisting of at least two internally-disjoint paths from $x$ to $y$ in which $x$ and $y$ have no common neighbor. \nThis is joint work with Sang-il Oum.
URL:https://dimag.ibs.re.kr/event/2022-02-21/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220228T163000
DTEND;TZID=Asia/Seoul:20220228T173000
DTSTAMP:20231211T212421
CREATED:20220228T073000Z
LAST-MODIFIED:20220227T104738Z
UID:5298-1646065800-1646069400@dimag.ibs.re.kr
SUMMARY:Sang-il Oum (엄상일)\, Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
DESCRIPTION:Every minor-closed class of matroids of bounded branch-width can be characterized by a minimal list of excluded minors\, but unlike graphs\, this list could be infinite in general. However\, for each fixed finite field $\mathbb F$\, the list contains only finitely many $\mathbb F$-representable matroids\, due to the well-quasi-ordering of $\mathbb F$-representable matroids of bounded branch-width under taking matroid minors [J. F. Geelen\, A. M. H. Gerards\, and G. Whittle (2002)]. But this proof is non-constructive and does not provide any algorithm for computing these $\mathbb F$-representable excluded minors in general. \nWe consider the class of matroids of path-width at most $k$ for fixed $k$. We prove that for a finite field $\mathbb F$\, every $\mathbb F$-representable excluded minor for the class of matroids of path-width at most~$k$ has at most $2^{|\mathbb{F}|^{O(k^2)}}$ elements. We can therefore compute\, for any integer $k$ and a fixed finite field $\mathbb F$\, the set of $\mathbb F$-representable excluded minors for the class of matroids of path-width $k$\, and this gives as a corollary a polynomial-time algorithm for checking whether the path-width of an $\mathbb F$-represented matroid is at most $k$. We also prove that every excluded pivot-minor for the class of graphs having linear rank-width at most $k$ has at most $2^{2^{O(k^2)}}$ vertices\, which also results in a similar algorithmic consequence for linear rank-width of graphs. \nThis is joint work with Mamadou M. Kanté\, Eun Jung Kim\, and O-joung Kwon.
URL:https://dimag.ibs.re.kr/event/2022-02-28/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220307T163000
DTEND;TZID=Asia/Seoul:20220307T173000
DTSTAMP:20231211T212421
CREATED:20220307T073000Z
LAST-MODIFIED:20220302T101458Z
UID:5315-1646670600-1646674200@dimag.ibs.re.kr
SUMMARY:Kevin Hendrey\, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (revisited)
DESCRIPTION:This talk follows on from the recent talk of Pascal Gollin in this seminar series\, but will aim to be accessible for newcomers. \nErdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. By relaxing `packing’ to `half-integral packing’\, Reed obtained an analogous result for odd cycles\, and gave a structural characterisation of when the (integral) packing version fails. \nWe prove some far-reaching generalisations of these theorems. First\, we show that if the edges of a graph are labelled by finitely many abelian groups\, then the cycles whose values avoid a fixed finite set for each abelian group satisfy the half-integral Erdős-Pósa property. Similarly to Reed\, we give a structural characterisation for the failure of the integral Erdős-Pósa property in this setting. This allows us to deduce the full Erdős-Pósa property for many natural classes of cycles. \nWe will look at applications of these results to graphs embedded on surfaces\, and also discuss some possibilities and obstacles for extending these results. \nThis is joint work with Kevin Hendrey\, Ken-ichi Kawarabayashi\, O-joung Kwon\, Sang-il Oum\, and Youngho Yoo.
URL:https://dimag.ibs.re.kr/event/2022-03-07/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220314T163000
DTEND;TZID=Asia/Seoul:20220314T173000
DTSTAMP:20231211T212421
CREATED:20220314T073000Z
LAST-MODIFIED:20220221T120247Z
UID:5218-1647275400-1647279000@dimag.ibs.re.kr
SUMMARY:Tuan Anh Do\, Rank- and tree-width of supercritical random graphs
DESCRIPTION:It is known that the rank- and tree-width of the random graph $G(n\,p)$ undergo a phase transition at $p = 1/n$; whilst for subcritical $p$\, the rank- and tree-width are bounded above by a constant\, for supercritical $p$\, both parameters are linear in $n$. The known proofs of these results use as a black box an important theorem of Benjamini\, Kozma\, and Wormald on the expansion of supercritical random graphs. We give a new\, short\, and direct proof of these results\, leading to more explicit bounds on these parameters\, and also consider the rank- and tree-width of supercritical random graphs closer to the critical point\, showing that this phase transition is smooth. \nThis is joint work with Joshua Erde and Mihyun Kang.
URL:https://dimag.ibs.re.kr/event/2022-03-14/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220321T163000
DTEND;TZID=Asia/Seoul:20220321T173000
DTSTAMP:20231211T212421
CREATED:20220321T073000Z
LAST-MODIFIED:20220310T234607Z
UID:5277-1647880200-1647883800@dimag.ibs.re.kr
SUMMARY:Jaehoon Kim (김재훈)\, Ramsey numbers of cycles versus general graphs
DESCRIPTION:The Ramsey number $R(F\,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains a copy of $F$ or its complement contains $H$. Burr in 1981 proved a pleasingly general result that for any graph $H$\, provided $n$ is sufficiently large\, a natural lower bound construction gives the correct Ramsey number involving cycles: $R(C_n\,H)=(n-1)(\chi(H)-1)+\sigma(H)$\, where $\sigma(H)$ is the minimum possible size of a colour class in a $\chi(H)$-colouring of $H$. Allen\, Brightwell and Skokan conjectured that the same should be true already when $n\geq |H|\chi(H)$. \nWe improve this 40-year-old result of Burr by giving quantitative bounds of the form $n\geq C|H|\log^4\chi(H)$\, which is optimal up to the logarithmic factor. In particular\, this proves a strengthening of the Allen-Brightwell-Skokan conjecture for all graphs $H$ with large chromatic number. \nThis is joint work with John Haslegrave\, Joseph Hyde and Hong Liu
URL:https://dimag.ibs.re.kr/event/2022-03-21/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220328T163000
DTEND;TZID=Asia/Seoul:20220328T173000
DTSTAMP:20231211T212421
CREATED:20220314T051725Z
LAST-MODIFIED:20220314T051725Z
UID:5383-1648485000-1648488600@dimag.ibs.re.kr
SUMMARY:Ben Lund\, Thresholds for incidence properties in finite vector spaces
DESCRIPTION:Suppose that $E$ is a subset of $\mathbb{F}_q^n$\, so that each point is contained in $E$ with probability $\theta$\, independently of all other points. Then\, what is the probability that there is an $m$-dimensional affine subspace that contains at least $\ell$ points of $E$? What is the probability that $E$ intersects all $m$-dimensional affine subspaces? We give Erdős-Renyi threshold functions for these properties\, in some cases sharp thresholds. Our results improve previous work of Chen and Greenhill. This is joint work with Jeong Han Kim\, Thang Pham\, and Semin Yoo.
URL:https://dimag.ibs.re.kr/event/2022-03-28/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220411T163000
DTEND;TZID=Asia/Seoul:20220411T173000
DTSTAMP:20231211T212421
CREATED:20220401T073000Z
LAST-MODIFIED:20220410T120744Z
UID:5326-1649694600-1649698200@dimag.ibs.re.kr
SUMMARY:Younjin Kim (김연진)\, On the extremal problems related to Szemerédi's theorem
DESCRIPTION:In 1975\, Szemerédi proved that for every real number $\delta > 0 $ and every positive integer $k$\, there exists a positive integer $N$ such that every subset $A$ of the set $\{1\, 2\, \cdots\, N \}$ with $|A| \geq \delta N$ contains an arithmetic progression of length $k$. There has been a plethora of research related to Szemerédi’s theorem in many areas of mathematics. In 1990\, Cameron and Erdős proposed a conjecture about counting the number of subsets of the set $\{1\,2\, \dots\, N\}$ which do not contain an arithmetic progression of length $k$. In the talk\, we study a natural higher dimensional version of this conjecture\, and also introduce recent extremal problems related to Szemerédi’s theorem.
URL:https://dimag.ibs.re.kr/event/2022-04-11/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220425T163000
DTEND;TZID=Asia/Seoul:20220425T173000
DTSTAMP:20231211T212421
CREATED:20220425T073000Z
LAST-MODIFIED:20220410T130608Z
UID:5322-1650904200-1650907800@dimag.ibs.re.kr
SUMMARY:Boram Park (박보람)\, Odd coloring of sparse graphs
DESCRIPTION:We introduce an odd coloring of a graph\, which was introduced very recently\, motivated by parity type colorings of graphs. A proper vertex coloring of graph $G$ is said to be odd if for each non-isolated vertex $x \in V (G)$ there exists a color $c$ such that $c$ is used an odd number of times in the neighborhood of $x$. The recent work on this topic will be presented\, and the work is based on Eun-Kyung Cho\, Ilkyoo Choi\, and Hyemin Kown.
URL:https://dimag.ibs.re.kr/event/2022-04-25/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220502T163000
DTEND;TZID=Asia/Seoul:20220502T173000
DTSTAMP:20231211T212421
CREATED:20220502T073000Z
LAST-MODIFIED:20220426T130131Z
UID:5511-1651509000-1651512600@dimag.ibs.re.kr
SUMMARY:Cheolwon Heo (허철원)\, The complexity of the matroid-homomorphism problems
DESCRIPTION:In this talk\, we introduce homomorphisms between binary matroids that generalize graph homomorphisms. For a binary matroid $N$\, we prove a complexity dichotomy for the problem $\rm{Hom}_\mathbb{M}(N)$ of deciding if a binary matroid $M$ admits a homomorphism to $N$. The problem is polynomial-time solvable if $N$ has a loop or has no circuits of odd length\, and is otherwise $\rm{NP}$-complete. We also get dichotomies for the list\, extension\, and retraction versions of the problem.\nThis is joint work with Hyobin Kim and Mark Siggers at Kyungpook National University.
URL:https://dimag.ibs.re.kr/event/2022-05-02/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220509T163000
DTEND;TZID=Asia/Seoul:20220509T173000
DTSTAMP:20231211T212421
CREATED:20220509T073000Z
LAST-MODIFIED:20220425T071741Z
UID:5524-1652113800-1652117400@dimag.ibs.re.kr
SUMMARY:Kyeongsik Nam (남경식)\, Large deviations for subgraph counts in random graphs
DESCRIPTION:The upper tail problem for subgraph counts in the Erdos-Renyi graph\, introduced by Janson-Ruciński\, has attracted a lot of attention. There is a class of Gibbs measures associated with subgraph counts\, called exponential random graph model (ERGM). Despite its importance\, lots of fundamental questions have remained unanswered owing to the lack of exact solvability. In this talk\, I will talk about a brief overview on the upper tail problem and the concentration of measure results for the ERGM. Joint work with Shirshendu Ganguly and Ella Hiesmayr.
URL:https://dimag.ibs.re.kr/event/2022-05-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220516T163000
DTEND;TZID=Asia/Seoul:20220516T173000
DTSTAMP:20231211T212421
CREATED:20220516T073000Z
LAST-MODIFIED:20220502T220811Z
UID:5553-1652718600-1652722200@dimag.ibs.re.kr
SUMMARY:Andreas Holmsen\, A colorful version of the Goodman-Pollack-Wenger transversal theorem
DESCRIPTION:Hadwiger’s transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane transversals in $\mathbb{R}^d$ by Goodman\, Pollack\, and Wenger. Here we establish a colorful extension of their theorem\, which proves a conjecture of Arocha\, Bracho\, and Montejano. The proof uses topological methods\, in particular the Borsuk-Ulam theorem. The same methods also allow us to generalize some colorful transversal theorems of Montejano and Karasev.
URL:https://dimag.ibs.re.kr/event/2022-05-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220523T163000
DTEND;TZID=Asia/Seoul:20220523T173000
DTSTAMP:20231211T212421
CREATED:20220523T073000Z
LAST-MODIFIED:20220516T214605Z
UID:5451-1653323400-1653327000@dimag.ibs.re.kr
SUMMARY:Stijn Cambie\, The precise diameter of reconfiguration graphs
DESCRIPTION:Reconfiguration is about changing instances in small steps. For example\, one can perform certain moves on a Rubik’s cube\, each of them changing its configuration a bit. In this case\, in at most 20 steps\, one can end up with the preferred result. One could construct a graph with as nodes the possible configurations of the Rubik’s cube (up to some isomorphism) and connect two nodes if one can be obtained by applying only one move to the other. Finding an optimal solution\, i.e. a minimum number of moves to solve a Rubik’s cube is now equivalent to finding the distance in the graph. \nWe will wonder about similar problems in reconfiguration\, but applied to list- and DP-colouring. In this case\, the small step consists of recolouring precisely one vertex. Now we will be interested in the diameter of the reconfiguration graph and show that sometimes we can determine the precise diameters of these. \nAs such\, during this talk\, we present some main ideas of [arXiv:2204.07928].
URL:https://dimag.ibs.re.kr/event/2022-05-23/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220530T163000
DTEND;TZID=Asia/Seoul:20220530T173000
DTSTAMP:20231211T212421
CREATED:20220530T073000Z
LAST-MODIFIED:20220523T020807Z
UID:5495-1653928200-1653931800@dimag.ibs.re.kr
SUMMARY:Hongseok Yang (양홍석)\, Learning Symmetric Rules with SATNet
DESCRIPTION:SATNet is a differentiable constraint solver with a custom backpropagation algorithm\, which can be used as a layer in a deep-learning system. It is a promising proposal for bridging deep learning and logical reasoning. In fact\, SATNet has been successfully applied to learn\, among others\, the rules of a complex logical puzzle\, such as Sudoku\, just from input and output pairs where inputs are given as images. In this paper\, we show how to improve the learning of SATNet by exploiting symmetries in the target rules of a given but unknown logical puzzle or more generally a logical formula. We present SymSATNet\, a variant of SATNet that translates the given symmetries of the target rules to a condition on the parameters of SATNet and requires that the parameters should have a particular parametric form that guarantees the condition. The requirement dramatically reduces the number of parameters to learn for the rules with enough symmetries\, and makes the parameter learning of SymSATNet much easier than that of SATNet. We also describe a technique for automatically discovering symmetries of the target rules from examples. Our experiments with Sudoku and Rubik’s cube show the substantial improvement of SymSATNet over the baseline SATNet. \nThis is joint work with Sangho Lim and Eungyeol Oh.
URL:https://dimag.ibs.re.kr/event/2022-05-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220613T163000
DTEND;TZID=Asia/Seoul:20220613T173000
DTSTAMP:20231211T212421
CREATED:20220613T073000Z
LAST-MODIFIED:20220605T122500Z
UID:5578-1655137800-1655141400@dimag.ibs.re.kr
SUMMARY:Amadeus Reinald\, Twin-width and forbidden subdivisions
DESCRIPTION:Twin-width is a recently introduced graph parameter based on vertex contraction sequences. On classes of bounded twin-width\, problems expressible in FO logic can be solved in FPT time when provided with a sequence witnessing the bound. Classes of bounded twin-width are very diverse\, notably including bounded rank-width\, $\Omega ( \log (n) )$-subdivisions of graphs of size $n$\, and proper minor closed classes. In this talk\, we look at developing a structural understanding of twin-width in terms of induced subdivisions. \nStructural characterizations of graph parameters have mostly looked at graph minors\, for instance\, bounded tree-width graphs are exactly those forbidding a large wall minor. An analogue in terms of induced subgraphs could be that\, for sparse graphs\, large treewidth implies the existence of an induced subdivision of a large wall. However\, Sintiari and Trotignon have ruled out such a characterization by showing the existence of graphs with arbitrarily large girth avoiding any induced subdivision of a theta ($K_{2\,3}$). Abrishami\, Chudnovsky\, Hajebi and Spirkl have recently shown that such (theta\, triangle)-free classes have nevertheless logarithmic treewidth. \nAfter an introduction to twin-width and its ties to vertex orderings\, we show that theta-free graphs of girth at least 5 have bounded twin-width. \nJoint work with Édouard Bonnet\, Eun Jung Kim\, Stéphan Thomassé and Rémi Watrigant.
URL:https://dimag.ibs.re.kr/event/2022-06-13/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220627T163000
DTEND;TZID=Asia/Seoul:20220627T173000
DTSTAMP:20231211T212421
CREATED:20220627T073000Z
LAST-MODIFIED:20220627T115421Z
UID:5733-1656347400-1656351000@dimag.ibs.re.kr
SUMMARY:Ben Lund\, Radial projections in finite space
DESCRIPTION:Given a set $E$ and a point $y$ in a vector space over a finite field\, the radial projection $\pi_y(E)$ of $E$ from $y$ is the set of lines that through $y$ and points of $E$. Clearly\, $|\pi_y(E)|$ is at most the minimum of the number of lines through $y$ and $|E|$. I will discuss several results on the general question: For how many points $y$ can $|\pi_y(E)|$ be much smaller than this maximum? \nThis is motivated by an analogous question in fractal geometry. The Hausdorff dimension of a radial projection of a set $E$ in $n$ dimensional real space will typically be the minimum of $n-1$ and the Hausdorff dimension of $E$. Several recent papers by authors including Matilla\, Orponen\, Liu\, Shmerikin\, and Wang consider the question: How large can the set of points with small radial projections be? This body of work has several important applications\, including recent progress on the Falconer distance conjecture. \nThis is joint with Thang Pham and Vu Thi Huong Thu.
URL:https://dimag.ibs.re.kr/event/2022-06-27/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220704T163000
DTEND;TZID=Asia/Seoul:20220704T173000
DTSTAMP:20231211T212421
CREATED:20220704T073000Z
LAST-MODIFIED:20220609T232436Z
UID:5797-1656952200-1656955800@dimag.ibs.re.kr
SUMMARY:Eric Vigoda\, Computational phase transition and MCMC algorithms
DESCRIPTION:This talk will highlight recent results establishing a beautiful computational phase transition for approximate counting/sampling in (binary) undirected graphical models (such as the Ising model or on weighted independent sets). The computational problem is to sample from the equilibrium distribution of the model or equivalently approximate the corresponding normalizing factor known as the partition function. We show that when correlations die off on the infinite D-regular tree then the Gibbs sampler has optimal mixing time of $O(n \log n)$ on any graph of maximum degree D\, whereas when the correlations persist (in the limit) then the sampling/counting problem are NP-hard to approximate. The Gibbs sampler is a simple Markov Chain Monte Carlo (MCMC) algorithm. Key to these mixing results are a new technique known as spectral independence which considers the pairwise influence of vertices. We show that spectral independence implies an optimal convergence rate for a variety of MCMC algorithms.
URL:https://dimag.ibs.re.kr/event/2022-07-04/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220711T163000
DTEND;TZID=Asia/Seoul:20220711T173000
DTSTAMP:20231211T212421
CREATED:20220711T073000Z
LAST-MODIFIED:20220706T054910Z
UID:5896-1657557000-1657560600@dimag.ibs.re.kr
SUMMARY:Kevin Hendrey\, Product Structure of Graph Classes with Bounded Treewidth
DESCRIPTION:The strong product $G\boxtimes H$ of graphs $G$ and $H$ is the graph on the cartesian product $V(G)\times V(H)$ such that vertices $(v\,w)$ and $(x\,y)$ are adjacent if and only if $\max\{d_G(v\,x)\,d_H(w\,y)\}=1$. Graph product structure theory aims to describe complicated graphs in terms of subgraphs of strong products of simpler graphs. This area of research was initiated by Dujmović\, Joret\, Micek\, Morin\, Ueckerdt and Wood\, who showed that every planar graph is a subgraph of the strong product of a $H\boxtimes P\boxtimes K_3$ for some path $P$ and some graph $H$ of treewidth at most $3$. In this talk\, I will discuss the product structure of various graph classes of bounded treewidth. As an example\, we show that there is a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that every planar graph of treewidth at most $k$ is a subgraph of $H\boxtimes K_{f(k)}$ for some graph $H$ of treewidth at most $3$. \nThis is based on joint work with Campbell\, Clinch\, Distel\, Gollin\, Hickingbotham\, Huynh\, Illingworth\, Tamitegama\, Tan and Wood.
URL:https://dimag.ibs.re.kr/event/2022-07-11/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220718T163000
DTEND;TZID=Asia/Seoul:20220718T173000
DTSTAMP:20231211T212421
CREATED:20220622T073000Z
LAST-MODIFIED:20220621T152714Z
UID:5878-1658161800-1658165400@dimag.ibs.re.kr
SUMMARY:Jinyoung Park (박진영)\, Thresholds 1/2
DESCRIPTION:Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006\, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set\, its threshold is never far from its “expectation-threshold\,” which is a natural (and often easy to calculate) lower bound on the threshold. \nIn the first talk on Monday\, I will introduce the Kahn-Kalai Conjecture with some motivating examples and then briefly talk about the recent resolution of the Kahn-Kalai Conjecture due to Huy Pham and myself. \nIn the second talk on Tuesday\, I will discuss our proof of the conjecture in detail.
URL:https://dimag.ibs.re.kr/event/2022-07-18/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220719T140000
DTEND;TZID=Asia/Seoul:20220719T160000
DTSTAMP:20231211T212421
CREATED:20220719T050000Z
LAST-MODIFIED:20220621T152553Z
UID:5880-1658239200-1658246400@dimag.ibs.re.kr
SUMMARY:Jinyoung Park (박진영)\, Thresholds 2/2
DESCRIPTION:Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006\, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set\, its threshold is never far from its “expectation-threshold\,” which is a natural (and often easy to calculate) lower bound on the threshold. \nIn the first talk on Monday\, I will introduce the Kahn-Kalai Conjecture with some motivating examples and then briefly talk about the recent resolution of the Kahn-Kalai Conjecture due to Huy Pham and myself. \nIn the second talk on Tuesday\, I will discuss our proof of the conjecture in detail.
URL:https://dimag.ibs.re.kr/event/2022-07-19/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220801T163000
DTEND;TZID=Asia/Seoul:20220801T173000
DTSTAMP:20231211T212421
CREATED:20220801T073000Z
LAST-MODIFIED:20220620T165417Z
UID:5867-1659371400-1659375000@dimag.ibs.re.kr
SUMMARY:Seunghun Lee (이승훈)\, Inscribable order types
DESCRIPTION:We call an order type inscribable if it is realized by a point configuration where all extreme points are all on a circle. In this talk\, we investigate inscribability of order types. We first show that every simple order type with at most 2 interior points is inscribable\, and that the number of such order types is $\Theta(\frac{4^n}{n^{3/2}})$. We further construct an infinite family of minimally uninscribable order types. The proof of uninscribability mainly uses Möbius transformations. We also suggest open problems around inscribability. This is a joint work with Michael Gene Dobbins.
URL:https://dimag.ibs.re.kr/event/2022-08-01/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220809T163000
DTEND;TZID=Asia/Seoul:20220809T173000
DTSTAMP:20231211T212421
CREATED:20220808T073000Z
LAST-MODIFIED:20220715T132940Z
UID:5821-1660062600-1660066200@dimag.ibs.re.kr
SUMMARY:Eun Jung Kim (김은정)\, Directed flow-augmentation
DESCRIPTION:We show a flow-augmentation algorithm in directed graphs: There exists a polynomial-time algorithm that\, given a directed graph G\, two integers $s\,t\in V(G)$\, and an integer $k$\, adds (randomly) to $G$ a number of arcs such that for every minimal st-cut $Z$ in $G$ of size at most $k$\, with probability $2^{−\operatorname{poly}(k)}$ the set $Z$ becomes a minimum $st$-cut in the resulting graph.\nThe directed flow-augmentation tool allows us to prove fixed-parameter tractability of a number of problems parameterized by the cardinality of the deletion set\, whose parameterized complexity status was repeatedly posed as open problems:\n(1) Chain SAT\, defined by Chitnis\, Egri\, and Marx [ESA’13\, Algorithmica’17]\,\n(2) a number of weighted variants of classic directed cut problems\, such as Weighted st-Cut\, Weighted Directed Feedback Vertex Set\, or Weighted Almost 2-SAT.\nBy proving that Chain SAT is FPT\, we confirm a conjecture of Chitnis\, Egri\, and Marx that\, for any graph H\, if the List H-Coloring problem is polynomial-time solvable\, then the corresponding vertex-deletion problem is fixed-parameter tractable. \nJoint work with Stefan Kratsch\, Marcin Pilipczuk\, Magnus Wahlström.
URL:https://dimag.ibs.re.kr/event/2022-08-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220816T163000
DTEND;TZID=Asia/Seoul:20220816T173000
DTSTAMP:20231211T212421
CREATED:20220718T235006Z
LAST-MODIFIED:20220718T235006Z
UID:5967-1660667400-1660671000@dimag.ibs.re.kr
SUMMARY:Noleen Köhler\, Testing first-order definable properties on bounded degree graphs
DESCRIPTION:Property testers are probabilistic algorithms aiming to solve a decision problem efficiently in the context of big-data. A property tester for a property P has to decide (with high probability correctly) whether a given input graph has property P or is far from having property P while having local access to the graph. We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree model. We show that any FO property that is defined by a formula with quantifier prefix ∃*∀* is testable\, while there exists an FO property that is expressible by a formula with quantifier prefix ∀*∃* that is not testable. In the dense graph model\, a similar picture is long known (Alon\, Fischer\, Krivelevich\, Szegedy\, Combinatorica 2000)\, despite the very different nature of the two models. In particular\, we obtain our lower bound by a first-order formula that defines a class of bounded-degree expanders\, based on zig-zag products of graphs. \nThis is joint work with Isolde Adler and Pan Peng.
URL:https://dimag.ibs.re.kr/event/2022-08-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220823T163000
DTEND;TZID=Asia/Seoul:20220823T173000
DTSTAMP:20231211T212421
CREATED:20220823T073000Z
LAST-MODIFIED:20220804T235842Z
UID:5971-1661272200-1661275800@dimag.ibs.re.kr
SUMMARY:Raul Lopes\, Temporal Menger and related problems
DESCRIPTION:A temporal graph is a graph whose edges are available only at specific times. In this scenario\, the only valid walks are the ones traversing adjacent edges respecting their availability\, i.e. sequence of adjacent edges whose appearing times are non-decreasing. \nGiven a graph G and vertices s and t of G\, Menger’s Theorem states that the maximum number of (internally) vertex disjoint s\,t-paths is equal to the minimum size of a subset X for which G-X contains no s\,t-path. This is a classical result in Graph Theory\, taught in most basic Graph Theory courses\, and it holds also when G is directed and when edge disjoint paths and edge cuts are considered instead. A direct translation of Menger’s Theorem to the temporal context has been known not to hold since an example was shown in the seminal paper by Kempe\, Kleinberg and Kumar (STOC’00). In this talk\, an overview of possible temporal versions of Menger’s Theorem will be discussed\, as well as the complexity of the related problems.
URL:https://dimag.ibs.re.kr/event/2022-08-23/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220830T163000
DTEND;TZID=Asia/Seoul:20220830T173000
DTSTAMP:20231211T212421
CREATED:20220830T073000Z
LAST-MODIFIED:20220805T023825Z
UID:6018-1661877000-1661880600@dimag.ibs.re.kr
SUMMARY:Jun Gao\, Number of (k-1)-cliques in k-critical graph
DESCRIPTION:We prove that for $n>k\geq 3$\, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number\, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai. \nThis is joint work with Jie Ma.
URL:https://dimag.ibs.re.kr/event/2022-08-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR