2023
(scheduled) March 30, 2023: Debsoumya Chakraborti , DMS Combinatorics Seminar
(scheduled) March 30, 2023: Sang-il Oum (엄상일) , Colloquium , Department of Mathematics, Kyunghee University, Seoul, Korea.Building the hierarchy of graph classes
March 15, 2023: Jinha Kim (김진하) , Moscow-Beijing Topology Seminar Collapsibility of non-cover complexes of graphs, and the minimal exclusion sequence
March 7, 2023: Alexander Clifton , ISU Discrete Math Seminar Ramsey Theory for Diffsequences
February 24, 2023: Alexander Clifton , 27th KIAS Combinatorics Workshop Covering the hypercube and other grids
January 28, 2023: O-joung Kwon (권오정) , Workshop on Graph Coloring and Related Topics Group vertex-arboricity of group-labelled graphs
January 28, 2023: Sang-il Oum (엄상일) , Workshop on Graph Coloring and Related Topics Improper colorings regarding Hadwiger’s conjecture
January 24, 2023: O-joung Kwon (권오정) , ACM-SIAM Symposium on Discrete Algorithms (SODA23) A Half-Integral Erdős-Pósa Theorem for Directed Odd Cycles
January 23, 2023: Sebastian Wiederrecht , ACM-SIAM Symposium on Discrete Algorithms (SODA23) Excluding Single-Crossing Matching Minors in Bipartite Graphs
January 16, 2023: Sebastian Wiederrecht , Mathematical Research Seminar Excluding a single-crossing matching minor
January 15, 2023: Hongseok Yang (양홍석) , Languages for Inference workshop (LAFI 2023) Introduction to the tensor-programs framework, a PL approach that helps analyse theoretical properties of deep learning.
January 12, 2023: Sebastian Wiederrecht , AlGCo Seminar Excluding Single-Crossing Matching Minors in Bipartite Graphs
January 7, 2023: Ben Lund , AMS Special Session on Distance Problems in Continuous, Discrete and Finite Field Settings I, 2023 Joint Mathematics Meetings (JMM 2023) Radial projection theorems in finite spaces
2022
December 28, 2022: Debsoumya Chakraborti , Meet-in-the-Middle
December 19, 2022: Sang-il Oum (엄상일) , 2022 BrainLink - Combinatorial Algebraic Geometry (2022 우수연구자교류지원 기술교류회 - 조합 대수기하학 국제교류회) (December 18-21), Korean Federation of Science and Technology Societies (한국과학기술단체총연합회), Sheraton Grand Incheon Hotel, Incheon, Korea.Γ-graphic delta-matroids and their applications
December 2, 2022: Sang-il Oum (엄상일) , International Conference on Matrix Theory with Applications to Combinatorics, Optimization and Data Science Γ-graphic delta-matroids and their applications
December 1, 2022: Sang-il Oum (엄상일) , Colloquium Building the hierarchy of graph classes
November 15, 2022: Sebastian Wiederrecht , Discrete Math Seminar Excluding single-crossing matching minors in bipartite graphs
November 11, 2022: Sang-il Oum (엄상일) , Combinatorics Today Series 2022 Building the hierarchy of graph classes
November 11, 2022: Linda Cook , Tutte Colloquium Forbidding some induced cycles in a graph
November 9, 2022: Debsoumya Chakraborti , Combinatorics & Graph Theory Seminar Rainbow generalizations of combinatorial results
November 8, 2022: Jungho Ahn (안정호) , Discrete Math Seminar Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
November 7, 2022: Sebastian Wiederrecht , Discrete Math Seminar
November 4, 2022: Sang-il Oum (엄상일) , Fields Symposium A combinatorial path taken by June E Huh
November 3, 2022: Sebastian Wiederrecht , The 63rd IEEE Symposium on Foundations of Computer Science (FOCS 2022)
October 20, 2022: Sang-il Oum (엄상일) , 2022 Global KMS International Conference Building the hierarchy of graph classes
October 19, 2022: Alexander Clifton , 2022 Global KMS International Conference Odd Covers by Complete Bipartite Graphs
October 19, 2022: Jungho Ahn (안정호) , 2022 Global KMS International Conference The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
October 17, 2022: Linda Cook , Bonn Workshop on Combinatorial Optimization Detecting a long even hole
October 13, 2022: O-joung Kwon (권오정) , Colloquium
October 11, 2022: Alexander Clifton , Discrete Mathematics Seminar , University of Nebraska-Lincoln, Online, USA.
October 1, 2022: Jungho Ahn (안정호) , 2022 Combinatorics Workshop The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
September 30, 2022: Alexander Clifton , 2022 Combinatorics Workshop Reconstruction and Edge Reconstruction of Triangle-free Graphs
September 27, 2022: Alexander Clifton , Discrete Math Seminar Ramsey Theory for Diffsequences
September 22, 2022: Jungho Ahn (안정호) , 10th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2022) Bounds for the twin-width of graphs
September 19, 2022: Sebastian Wiederrecht , 10th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2022)
September 17, 2022: Kevin Hendrey , School on Structural Graph Theory in Hanyang University Product planar structure theorem and variants
September 17, 2022: O-joung Kwon (권오정) , School on Structural Graph Theory in Hanyang University Bounded expansion classes and beyond
September 17, 2022: J. Pascal Gollin , School on Structural Graph Theory in Hanyang University Tangles and abstract separation systems
September 16, 2022: J. Pascal Gollin , School on Structural Graph Theory in Hanyang University Menger’s theorem and Mader’s theorem
September 16, 2022: O-joung Kwon (권오정) , School on Structural Graph Theory in Hanyang University
September 16, 2022: Kevin Hendrey , School on Structural Graph Theory in Hanyang University Erdős-Pósa theorem and variants
September 13, 2022: Sebastian Wiederrecht , Discrete Math Seminar
August 31, 2022: J. Pascal Gollin , AlgoLoG Seminar Product structure of graph classes with bounded treewidth
August 19, 2022: Sang-il Oum (엄상일) , Workshop on Graph Theory and Combinatorics in Memory of Robin Thomas Building the hierarchy of graph classes
July 28, 2022: J. Pascal Gollin , 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications Product structure of graph classes with bounded treewidth
July 27, 2022: Rutger Campbell , 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications Counting well-quasi-ordered down-sets
July 27, 2022: Linda Cook , 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications Graphs with every hole the same length
July 25, 2022: Sang-il Oum (엄상일) , 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications Building the hierarchy of graph classes
July 12, 2022: J. Pascal Gollin , Forschungsseminare Product structure of graph classes with bounded treewidth
July 11, 2022: Kevin Hendrey , Discrete Math Seminar Product Structure of Graph Classes with Bounded Treewidth
June 27, 2022: Ben Lund , Discrete Math Seminar Radial projections in finite space
June 23, 2022: Sang-il Oum (엄상일) , Seymour 70+x workshop (June 20-24), ENS de Lyon, Lyon, France.Independent domination of graphs with bounded maximum degree
June 23, 2022: Linda Cook , Seymour 70+x workshop (June 20-24), ENS de Lyon, Lyon, France.Forbidding any orientation of $P_4$ and any clique bounds the dichromatic number
June 18, 2022: J. Pascal Gollin , 25th KIAS Combinatorics Workshop Product structure of graph classes with bounded treewidth
June 18, 2022: Ben Lund , 25th KIAS Combinatorics Workshop Maximal 3-wise intersecting families
June 16, 2022: Debsoumya Chakraborti , 25th KIAS Combinatorics Workshop Recent developments in graph saturation
June 16, 2022: O-joung Kwon (권오정) , 25th KIAS Combinatorics Workshop A survey on the Erdős–Pósa property
June 10, 2022: J. Pascal Gollin , Graz Combinatorics Seminar A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
June 10, 2022: Linda Cook , Combinatorial Optimization and Logistics Research Seminar Structural graph theory and algorithms: Detecting a long even hole and other problems
June 2, 2022: O-joung Kwon (권오정) , Colloquium Graph minor theory and beyond
June 1, 2022: Donggyu Kim (김동규) , Student Symposium in Combinatroics 2022 Stronger versions of Tutte’s wheel theorem for vertex-/pivot-minors
May 31, 2022: Debsoumya Chakraborti , Seminar Majority dynamics on random graphs
May 31, 2022: Sang-il Oum (엄상일) , Korea-Taiwan-Vietnam Joint Seminar in Combinatorics and Analysis Building the hierarchy of graph classes
May 27, 2022: O-joung Kwon (권오정) , KSIAM 2022 Spring Meeting Well-partitioned chordal graphs
May 24, 2022: Jinha Kim (김진하) , Topology and Combinatorics Seminar Fractional Helly theorem for Cartesian products of convex sets
May 23, 2022: Debsoumya Chakraborti , Joint CS-Math Seminar Existence of transversal in a Latin rectangle
May 20, 2022: Ben Lund , STCS Seminar Radial projections in vector spaces over finite fields
May 19, 2022: Dabeen Lee (이다빈) , Neuro-Symbolic AI Seminar , IBM Thomas J. Watson Research Center, Yorktown Heights, USA.Solving distributionally robust optimization under Wasserstein ambiguity
May 18, 2022: Ben Lund , Theory Seminar Radial projections in vector spaces over finite fields
May 17, 2022: Debsoumya Chakraborti , STCS Colloquium Mixing time and expanders
May 12, 2022: O-joung Kwon (권오정) , Colloquium Graph minor theory and beyond
April 28, 2022: Jungho Ahn (안정호) , 2022 KMS Spring Meeting Bounds for the twin-width of graphs
April 28, 2022: Jinha Kim (김진하) , 2022 KMS Spring Meeting Independent domination of graphs with bounded maximum degree
April 28, 2022: Donggyu Kim (김동규) , 2022 KMS Spring Meeting A stronger version of Tutte’s wheel theorem for vertex-minors
April 28, 2022: Duksang Lee (이덕상) , 2022 KMS Spring Meeting A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
April 22, 2022: Tuan Tran , Korea-Taiwan-Vietnam joint seminar in Combinatorics and Analysis Exponential decay of intersection volume and applications
April 11, 2022: O-joung Kwon (권오정) , Colloquium Introduction to graph minor theory
April 1, 2022: J. Pascal Gollin , Kevin Hendrey , Discrete Maths Seminar A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
March 28, 2022: Ben Lund , Discrete Math Seminar Thresholds for incidence properties in finite vector spaces
March 22, 2022: O-joung Kwon (권오정) , Graphs and Matroids Seminar Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
March 18, 2022: Sang-il Oum (엄상일) , 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
March 18, 2022: O-joung Kwon (권오정) , 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) Classes of intersection digraphs with good algorithmic properties
March 14, 2022: Tuan Anh Do , Discrete Math Seminar Rank- and tree-width of supercritical random graphs
March 8, 2022: Sang-il Oum (엄상일) , Graphs and Matroids Seminar Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
March 7, 2022: Kevin Hendrey , Discrete Math Seminar A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (revisited)
February 28, 2022: Sang-il Oum (엄상일) , Discrete Math Seminar Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
February 25, 2022: Sang-il Oum (엄상일) , SCMS Combinatorics Seminar Independent domination of graphs with bounded maximum degree
February 23, 2022: Jinha Kim (김진하) , 24th KIAS Combinatorics Workshop Independence complexes of graphs with no induced cyclers of length divisible by 3
February 22, 2022: Sang-il Oum (엄상일) , 24th KIAS Combinatorics Workshop Building the hierarchy of graph classes
February 21, 2022: Donggyu Kim (김동규) , Discrete Math Seminar A stronger version of Tutte’s wheel theorem for vertex-minors
February 18, 2022: Linda Cook , Graphes & Optimization Seminar Detecting a Long Even Hole.
February 17, 2022: Sang-il Oum (엄상일) , Industrial Mathematics Colloquium (산업수학콜로퀴움) Building the hierarchy of graph classes
February 15, 2022: Jinha Kim (김진하) , Discrete Math Seminar Independent domination of graphs with bounded maximum degree
February 8, 2022: J. Pascal Gollin , Discrete Math Seminar A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
January 25, 2022: O-joung Kwon (권오정) , Discrete Math Seminar Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
January 20, 2022: O-joung Kwon (권오정) , Seminar , Hanyang University, Seoul, Korea.Treewidth and applications
January 9, 2022: O-joung Kwon (권오정) , ACM-SIAM Symposium on Discrete Algorithms (SODA22) Directed Tangle Tree-Decompositions and Applications
January 7, 2022: O-joung Kwon (권오정) , Oberwolfach workshop on Graph Theory A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
January 6, 2022: Sang-il Oum (엄상일) , Oberwolfach workshop on Graph Theory Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
2021
December 21, 2021: Jungho Ahn (안정호) , 2021 Combinatorics Workshop Bounds for the twin-width of graphs
December 21, 2021: Minki Kim (김민기) , 2021 Combinatorics Workshop Fractional Helly theorem for Cartesian products of convex sets
December 20, 2021: Linda Cook , 2021 Combinatorics Workshop When all holes in a graph have the same length
December 14, 2021: Tuan Tran , Discrete Math Seminar Exponential decay of intersection volume with applications on list-decodability and sphere-covering bounds
December 14, 2021: Linda Cook , Algorithms Seminar , Utrecht University, Utrecht, Netherlands.Detecting a long even hole
December 14, 2021: J. Pascal Gollin , Forschungsseminar A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups III: Mangoes and Blueberries
December 14, 2021: J. Pascal Gollin , Forschungsseminar Obstructions for bounded branch-depth in matroids
December 8, 2021: Duksang Lee (이덕상) , 32nd International Symposium on Algorithms and Computation (ISAAC 2021) Γ-graphic delta-matroids and their applications
December 4, 2021: Tuan Tran , KSIAM 2021 Annual Meeting Exponential Decay of Intersection Volume with Applications on List- decodability and Gilbert-Varshamov Type Bound
December 4, 2021: Linda Cook , KSIAM 2021 Annual Meeting When all holes in a graph have the same length
December 3, 2021: Debsoumya Chakraborti , KSIAM 2021 Annual Meeting Bipartite Independence Number
November 30, 2021: Rutger Campbell , Graphs and Matroids Counting Well-Quasi-Ordered Down Sets
November 25, 2021: Donggyu Kim (김동규) , KAIST MATH GRADUATE STUDENT SEMINAR Eigenvalues and parity factors in graphs
November 22, 2021: O-joung Kwon (권오정) , Banff Workshop "Graph Product Structure Theory" Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
November 14, 2021: J. Pascal Gollin , 2021 China-Korea Young Scholars' Symposium on Discrete Mathematics, Statistics and Optimization A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
November 14, 2021: Sang-il Oum (엄상일) , 2021 China-Korea Young Scholars' Symposium on Discrete Mathematics, Statistics and Optimization Obstructions for graphs of linear rank-width at most k
November 14, 2021: Donggyu Kim (김동규) , 2021 China-Korea Young Scholars' Symposium on Discrete Mathematics, Statistics and Optimization Eigenvalues and parity factors in graphs
November 14, 2021: Tuan Tran , 2021 China-Korea Young Scholars' Symposium on Discrete Mathematics, Statistics and Optimization Maximal 3-wise intersecting families
November 14, 2021: O-joung Kwon (권오정) , 2021 China-Korea Young Scholars' Symposium on Discrete Mathematics, Statistics and Optimization
November 8, 2021: Tuan Tran , SCMS combinatorics seminar Maximal 3-wise intersecting families
November 4, 2021: Sang-il Oum (엄상일) , AlGCo Seminar Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
November 2, 2021: Ben Lund , Discrete Math Seminar Maximal 3-wise intersecting families
October 28, 2021: J. Pascal Gollin , Combinatorics Seminar Counting cliques in 1-planar graphs
October 26, 2021: Dabeen Lee (이다빈) , INFORMS Annual Meeting Conic Mixed-binary Sets: Convex Hull Characterizations And Applications
October 26, 2021: Donggyu Kim (김동규) , Discrete Math Seminar 𝝘-graphic delta-matroids and their applications
October 26, 2021: Tuan Tran , The 1st Workshop on Developments in Combinatorics Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound
October 25, 2021: Linda Cook , Topics in Algorithmic Graph Theory , University of Haifa, Online, Israel.Detecting a long even hole
October 22, 2021: Debsoumya Chakraborti , Young Researchers in Extremal and Probabilistic Combinatorics Mixing time and expanders
October 21, 2021: Kevin Hendrey , Young Researchers in Extremal and Probabilistic Combinatorics Extremal functions for sparse minors
October 21, 2021: Ben Lund , Young Researchers in Extremal and Probabilistic Combinatorics Maximal 3-wise intersecting families
October 21, 2021: Donggyu Kim (김동규) , 2021 KMS Annual Meeting 𝝘-graphic delta-matroids and their applications
October 21, 2021: Jungho Ahn (안정호) , 2021 KMS Annual Meeting Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
October 21, 2021: Minki Kim (김민기) , 2021 KMS Annual Meeting Leray numbers of tolerance complexes
October 13, 2021: Ben Lund , TCS Seminar , IIT Bombay, Bombay, India.Simple proofs for finite Furstenberg sets
October 8, 2021: Sang-il Oum (엄상일) , Graz Combinatorics Seminar Obstructions for graphs of linear rank-width at most k
October 6, 2021: Debsoumya Chakraborti , Discrete Math Seminar An approximate version of Brualdi-Ryser-Stein conjecture
October 1, 2021: O-joung Kwon (권오정) , Dagstuhl-Seminar 21391: Sparsity in Algorithms, Combinatorics and Logic Obstructions for bounded shrub-depth and rank-depth
September 27, 2021: Jinha Kim (김진하) , SCMS combinatorics seminar The homotopy type of the independence complex of ternary graphs
September 24, 2021: J. Pascal Gollin , 96th KPPY Combinatorics Workshop Counting cliques in 1-planar graphs
September 17, 2021: O-joung Kwon (권오정) , IIBS 2021-2 Lunch Seminar László Lovász – 완벽 그래프(perfect graph)에 대한 이야기
September 13, 2021: Dabeen Lee (이다빈) , Department Seminar , Sungkyunkwan University, Suwon, Korea.Recent progress on chance-constrained optimization
September 7, 2021: Dabeen Lee (이다빈) , Discrete Math Seminar Mixing sets, submodularity, and chance-constrained optimization
September 6, 2021: Jinha Kim (김진하) , European Conference on Combinatorics, Graph Theory and Applications 2021 (EUROCOMB 2021) Independence complexes of ternary graphs
August 17, 2021: Linda Cook , Discrete Math Seminar Two results on graphs with holes of restricted lengths
August 13, 2021: Dabeen Lee (이다빈) , Business Analytics Seminar (Online), The University of Sydney Business School Test score algorithms for budgeted stochastic utility maximization
August 10, 2021: Duksang Lee (이덕상) , Discrete Math Seminar Intertwining connectivities for vertex-minors and pivot-minors
July 22, 2021: Dabeen Lee (이다빈) , Minisymposium on Advances and Trends in Mixed Integer and Nonconvex Optimization, SIAM Conference on Optimization Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
July 22, 2021: Sang-il Oum (엄상일) , Minisymposium on Graph Structure, SIAM Conference on Discrete Mathematics Obstructions for bounded shrub-depth and rank-depth of graphs
June 29, 2021: Jeong Ok Choi (최정옥) , Discrete Math Seminar Invertibility of circulant matrices of arbitrary size
June 8, 2021: O-joung Kwon (권오정) , Discrete Math Seminar Classes of intersection digraphs with good algorithmic properties
June 4, 2021: Ben Lund , Moscow Conference on Combinatorics and Applications (MoCCA '20) Finite field Kakeya and Furstenberg sets
May 25, 2021: Ben Lund , Discrete Math Seminar Limit shape of lattice Zonotopes
May 18, 2021: J. Pascal Gollin , Discrete Math Seminar Enlarging vertex-flames in countable digraphs
May 10, 2021: Jungho Ahn (안정호) , 12th International Conference on Algorithms and Complexity (CIAC2021) Three problems on well-partitioned chordal graphs
May 5, 2021: J. Pascal Gollin , Forschungsseminar A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups II
May 4, 2021: J. Pascal Gollin , Forschungsseminar A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups I
April 30, 2021: Debsoumya Chakraborti , 2021 KMS Spring Meeting Generalized graph saturation
April 29, 2021: Minki Kim (김민기) , 2021 KMS Spring Meeting A system of disjoint representatives of line segments
April 29, 2021: O-joung Kwon (권오정) , 2021 KMS Spring Meeting Measuring what matters: a hybrid approach to dynamic programming with tree-width
April 29, 2021: Jungho Ahn (안정호) , 2021 KMS Spring Meeting Well-partitioned chordal graphs: obstruction set and applications
April 28, 2021: Minki Kim (김민기) , Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ) Domination numbers and non cover complexes of hypergraphs
April 28, 2021: Jinha Kim (김진하) , Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ) The homotopy type of the independence complex of graphs with no induced cycles of length divisible by 3
April 28, 2021: Ben Lund , Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ) Kakeya and Furstenberg sets over finite fields
April 28, 2021: Dabeen Lee (이다빈) , ISysE seminar , KAIST, Daejeon, Korea.Data-driven chance-constrained optimization under Wasserstein ambiguity
April 27, 2021: Jungho Ahn (안정호) , Discrete Math Seminar Well-partitioned chordal graphs with the obstruction set and applications
April 20, 2021: Dabeen Lee (이다빈) , Rookies Pitch (서울대학교 수리과학부 신진연구자 연구발표회) Data-driven chance-constrained optimization under Wasserstein ambiguity
April 20, 2021: Sang-il Oum (엄상일) , Discrete Math Seminar What is an isotropic system?
April 13, 2021: William Overman , Discrete Math Seminar Some Ordered Ramsey Numbers of Graphs on Four Vertices
April 9, 2021: Sang-il Oum (엄상일) , Bordeaux Graph Seminar , LaBRI, Bordeaux, France.A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
April 6, 2021: Rutger Campbell , Discrete Math Seminar Matroid orientability and representability
March 30, 2021: Casey Tompkins , Discrete Math Seminar 3-uniform hypergraphs avoiding a cycle of length four
March 9, 2021: Debsoumya Chakraborti , Discrete Math Seminar Some classical problems in graph saturation
March 2, 2021: Kevin Hendrey , Discrete Math Seminar A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
March 1, 2021: O-joung Kwon (권오정) , Graphs and Matroids A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
February 23, 2021: Minki Kim (김민기) , Discrete Math Seminar Rainbow paths and rainbow matchings
January 26, 2021: Tuan Tran , Discrete Math Seminar Minimum saturated families of sets
January 20, 2021: Dabeen Lee (이다빈) , Special Seminar Data-driven optimization: test score algorithms and distributionally robust approach
January 19, 2021: Ben Lund , Discrete Math Seminar Perfect matchings and derangements on graphs
January 12, 2021: Yunbum Kook (국윤범) , ACM-SIAM Symposium on Discrete Algorithms (SODA21) Vertex Sparsification for Edge Connectivity
January 5, 2021: O-joung Kwon (권오정) , Discrete Math Seminar Directed tangles and applications
2020
December 22, 2020: Jinha Kim (김진하) , Discrete Math Seminar On a conjecture by Kalai and Meshulam – the Betti number of the independence complex of ternary graphs
December 15, 2020: O-joung Kwon (권오정) , The 15th International Symposium on Parameterized and Exact Computation (IPEC'20) Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
December 14, 2020: Sang-il Oum (엄상일) , The 31st International Symposium on Algorithms and Computation (ISAAC'20) How to decompose a graph into a tree-like structure
December 10, 2020: Dabeen Lee (이다빈) , Séminaire virtuel de théorie des graphes et combinatoire en Rhône-Alpes et Auvergne The 𝜏=2 conjecture and multipartite clutters
December 9, 2020: Tuan Tran , AMSS Lecture A glimpse of Littlewood-Offord theory
December 1, 2020: Debsoumya Chakraborti , Discrete Math Seminar Rainbow matchings in edge-colored simple graphs
November 24, 2020: Kevin Hendrey , CMSA seminar Obstructions to bounded branch-depth in matroids
November 24, 2020: Duksang Lee (이덕상) , Discrete Math Seminar Characterizing matroids whose bases form graphic delta-matroids
November 5, 2020: Sang-il Oum (엄상일) , Séminaire virtuel de théorie des graphes et combinatoire en Rhône-Alpes et Auvergne Obstructions for bounded shrub-depth and rank-depth of graphs
October 27, 2020: Jeong Ok Choi (최정옥) , Discrete Math Seminar Various game-theoretic models on graphs
October 23, 2020: Ben Lund , CS Colloquium , SUNY Korea, Incheon, Korea.The finite field Kakeya problem
October 23, 2020: O-joung Kwon (권오정) , 2020 KMS Annual Meeting Half-integral Erdős–Pósa property of directed odd cycles
October 23, 2020: Jungho Ahn (안정호) , 2020 KMS Annual Meeting A polynomial kernel for 3-leaf power deletion
October 23, 2020: J. Pascal Gollin , 2020 KMS Annual Meeting Disjoint dijoins for classes of dicuts in finite and infinite digraphs
October 23, 2020: Minki Kim (김민기) , 2020 KMS Annual Meeting Topological colorful Helly for rainbow independent sets
October 23, 2020: Jinha Kim (김진하) , 2020 KMS Annual Meeting Rainbow paths and rainbow matchings in graphs
October 23, 2020: Duksang Lee (이덕상) , 2020 KMS Annual Meeting Characterizing matroids whose bases form graphic delta-matroids
October 16, 2020: Dabeen Lee (이다빈) , CS Colloquium , SUNY Korea, Incheon, Korea.Test score based algorithms for budgeted stochastic submodular maximization
September 29, 2020: Minki Kim (김민기) , Discrete Math Seminar Complexes of graphs with bounded independence number
September 22, 2020: Jinha Kim (김진하) , Discrete Math Seminar Collapsibility of Non-Cover Complexes of Graphs
September 15, 2020: Debsoumya Chakraborti , Discrete Math Seminar Maximum number of cliques in a graph with bounded maximum degree
September 8, 2020: Rutger Campbell , Discrete Math Seminar Disasters in abstracting combinatorial properties of linear dependence
August 27, 2020: Kevin Hendrey , SCMS Combinatorics Seminar Counting cliques in 1-planar graphs
August 26, 2020: Tuan Tran , CMSA seminar Singularity of random combinatorial matrices
August 25, 2020: Ben Lund , Discrete Math Seminar Point-plane incidence bounds
August 25, 2020: Yunbum Kook (국윤범) , 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) Incremental Lossless Graph Summarization
August 24, 2020: Tuan Tran , 2020 Combinatorics Workshop The singularity of random combinatorial matrices
August 18, 2020: Tuan Tran , Discrete Math Seminar Anti-concentration phenomena
August 11, 2020: Yunbum Kook (국윤범) , Discrete Math Seminar Vertex Sparsification for Edge Connectivity
July 20, 2020: J. Pascal Gollin , Graphs and Matroids Obstructions for bounded branch-depth in matroids
July 14, 2020: Casey Tompkins , Discrete Math Seminar
July 10, 2020: Dabeen Lee (이다빈) , IME Special Seminar , POSTECH, Pohang, Korea.Distributionally robust chance-constrained programs under Wasserstein ambiguity
June 25, 2020: Jungho Ahn (안정호) , 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2020) Well-partitioned chordal graphs: obstruction set and disjoint paths
June 9, 2020: Dabeen Lee (이다빈) , 21st Conference on Integer Programming and Combinatorial Optimization On a Generalization of the Chvátal-Gomory Closure
May 19, 2020: O-joung Kwon (권오정) , Discrete Math Seminar Mim-width: a width parameter beyond rank-width
May 14, 2020: Casey Tompkins , Extremal Sets seminar Saturation problems in the Ramsey theory of graphs, posets and point sets
April 21, 2020: Sang-il Oum (엄상일) , Discrete Math Seminar
April 14, 2020: Casey Tompkins , Discrete Math Seminar Saturation problems in the Ramsey theory of graphs, posets and point sets
April 7, 2020: J. Pascal Gollin , Discrete Math Seminar Disjoint dijoins for classes of dibonds in finite and infinite digraphs
March 24, 2020: Kevin Hendrey , Discrete Math Seminar Covering radius in the Hamming permutation space
March 19, 2020: Sang-il Oum (엄상일) , New Perspectives in Colouring and Structure 3-degenerate
induced subgraph
of a planar graph
March 17, 2020: Dabeen Lee (이다빈) , Discrete Math Seminar On a generalization of the Chvátal-Gomory closure
February 18, 2020: Dong Yeap Kang (강동엽) , Discrete Math Seminar Fragile minor-monotone parameters under random edge perturbation
January 4, 2020: Abhishek Methuku , 2020 One day Meeting on Extremal Combinatorics Bipartite Turán problems for ordered graphs
2019
December 20, 2019: Dabeen Lee (이다빈) , Frontiers in Industrial & Systems Engineering, 2019 Winter ISysE Symposium , KAIST, Daejeon, Korea.Linear programs with probabilistic constraints and binary mixing sets
December 19, 2019: Casey Tompkins , Seminar on Mathematical Foundations for Computer Science Generalized Turán problems
December 14, 2019: Abhishek Methuku , 95th KPPY Combinatorics Workshop Bipartite Turán problems for ordered graphs
December 13, 2019: Kevin Hendrey , 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC) The minimum connectivity forcing forest minors in large graphs
December 6, 2019: Kevin Hendrey , 63nd Annual Meeting of the Australian Mathematical Society Covering radius in the Hamming permutation space
November 9, 2019: Sang-il Oum (엄상일) , Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting Rank-width: Algorithmic and structural results
November 9, 2019: Dong Yeap Kang (강동엽) , Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting On minimal highly connected spanning subgraphs in dense digraphs
November 8, 2019: Dabeen Lee (이다빈) , Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting Joint Chance-constrained programs and the intersection of mixing sets through a submodularity lens
November 2, 2019: O-joung Kwon (권오정) , The 2nd East Asia Workshop on Extremal and Structural Graph Theory A survey of recent progress on Erdős-Pósa type problems
November 2, 2019: Abhishek Methuku , The 2nd East Asia Workshop on Extremal and Structural Graph Theory On a hypergraph bipartite Turán problem
October 29, 2019: J. Pascal Gollin , Discrete Math Seminar A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
October 27, 2019: Sang-il Oum (엄상일) , 2019 KMS Annual Meeting The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
October 27, 2019: J. Pascal Gollin , Extremal and Structural Graph Theory, 2019 KMS Annual Meeting Progress on the Ubiquity Conjecture
October 27, 2019: O-joung Kwon (권오정) , Extremal and Structural Graph Theory, 2019 KMS Annual Meeting Erdős-Pósa property of H-induced subdivisions
October 26, 2019: Kevin Hendrey , Extremal and Structural Graph Theory, 2019 KMS Annual Meeting Defective and clustered choosability of sparse graphs
October 26, 2019: Casey Tompkins , Extremal and Structural Graph Theory, 2019 KMS Annual Meeting Generalizations of the Erdős-Gallai theorem
October 20, 2019: Dabeen Lee (이다빈) , 2019 INFORMS Annual Meeting On some polytopes contained in the 0,1 hypercube that have a small Chvatal rank
October 20, 2019: Dabeen Lee (이다빈) , 2019 INFORMS Annual Meeting Joint chance-constrained programs and intersection of mixing sets through a submodularity lens
October 1, 2019: Casey Tompkins , Discrete Math Seminar , IBS Discrete Mathematics Group, Daejeon, Korea.Extremal problems for Berge hypergraphs
September 24, 2019: Sang-il Oum (엄상일) , The 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019), TU Wien Branch-depth: Generalizing tree-depth of graphs
September 10, 2019: Kevin Hendrey , Discrete Math Seminar The minimum connectivity forcing forest minors in large graphs
August 14, 2019: Dong Yeap Kang (강동엽) , 2019 Combinatorics Workshop Recent advances in degenerate Turán-type problems
August 13, 2019: Dabeen Lee (이다빈) , 2019 Combinatorics Workshop On the Chvatal rank for integer programming
August 12, 2019: Abhishek Methuku , 2019-2 IBS One-Day Conference on Extremal Graph Theory Bipartite Turán problems for ordered graphs
August 1, 2019: Sang-il Oum (엄상일) , 2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures Branch-depth: Generalizing tree-depth of graphs
July 16, 2019: Dabeen Lee (이다빈) , Discrete Math Seminar Integrality of set covering polyhedra and clutter minors
July 4, 2019: Sang-il Oum (엄상일) , Graph Colouring: from Structure to Algorithms The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
June 6, 2019: Sang-il Oum (엄상일) , International Conference on Network Games, Tropical Geometry, and Quantum Communication
May 28, 2019: Sang-il Oum (엄상일) , Mini-symposium “structural graph theory”, CanaDAM 2019 The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
May 1, 2019: Sang-il Oum (엄상일) , Structural Graph Theory and Graph Coloring Branch-depth: Generalizing tree-depth of graphs
April 20, 2019: Sang-il Oum (엄상일) , Plenary Lecture, 2019 KMS Spring Meeting How to decompose a graph into a tree-like structure
April 16, 2019: Sang-il Oum (엄상일) , PCS Seminar How to decompose a graph into a tree-like structure
March 31, 2019: Sang-il Oum (엄상일) , 2019 Spring Jinhua Workshop on Graph Theory Branch-depth: Generalizing tree-depth of graphs
March 28, 2019: Sang-il Oum (엄상일) , Colloquium
March 22, 2019: Sang-il Oum (엄상일) , Special Session on Structural Graph Theory, AMS Spring Central and Western Joint Sectional Meeting Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded
February 21, 2019: Sang-il Oum (엄상일) , Taipei International Workshop on Combinatorics and Graph Theory Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded
February 11, 2019: Dong Yeap Kang (강동엽) , 2019-1 IBS Workshop on Graph Theory On the rational Turán exponents conjecture
2018
December 22, 2018: Dong Yeap Kang (강동엽) , 22nd KIAS Combinatorics Workshop Some extremal results on highly connected tournament-like digraphs
December 1, 2018: Sang-il Oum (엄상일) , 2018 SCMS Workshop on Extremal and Structural Graph Theory Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded
