IBS/KAIST Discrete Math Seminar

discrete mathematics combinatorics

Institute for Basic Science / Korea Advanced Institute of Science and Technology

Audience:	Researchers in the discipline
Seminar series time:	Tuesday 07:30-08:30 in your time zone, UTC
Organizer:	Sang-il Oum*
	*contact for this listing

Description: Research seminar in discrete math, graph theory

Talks are broadcasted on YouTube Live if the speaker agrees.

Upcoming talks

Past talks

Your time			Speaker	Title
Tue	Jul 02	07:30	Kisun Lee	TBA
Tue	Jun 18	07:30	Semin Yoo	TBA
Tue	Jun 11	07:30	Maria Chudnovsky	TBA
Tue	Jun 04	07:30	Jane Tan	TBA
Tue	May 28	07:30	Yongho Shin	Three-way online correlated selection
Tue	May 21	07:30	Vadim V. Lozin	TBA
Tue	May 14	07:30	Niloufar Fuladi	Cross-cap drawings and signed reversal distance
Tue	May 07	07:30	Tony Huynh	Aharoni’s rainbow cycle conjecture holds up to an additive constant
Tue	Apr 30	07:30	Maximilian Gorsky	Towards the half-integral Erdős-Pósa property for even dicycles
Tue	Apr 23	07:30	Víctor Dalmau	Right-adjoints of Datalog Programs
Tue	Apr 16	07:30	Magnus Wahlström	Algorithmic aspects of linear delta-matroids
Tue	Apr 09	07:30	Eero Räty	Positive discrepancy, MaxCut and eigenvalues of graphs
Tue	Apr 02	07:30	Casey Tompkins	On graphs without cycles of length 0 modulo 4
Tue	Mar 26	07:30	Evangelos Protopapas	Erdős-Pósa Dualities for Minors
Tue	Mar 12	07:30	Linda Cook	On polynomial degree-boundedness
Tue	Feb 27	07:30	Jie Han	Perfect matchings in dense uniform hypergraphs
Wed	Feb 14	07:30	Sebastian Wiederrecht	Packing even directed circuits quarter-integrally
Tue	Feb 06	07:30	Ander Lamaison	Uniform Turán density beyond 3-graphs
Tue	Jan 23	07:30	Zichao Dong	Convex polytopes in non-elongated point sets in $\mathbb{R}^d$
Tue	Jan 16	07:30	Matthew Kroeker	Average flat-size in complex-representable matroids
Thu	Jan 11	07:30	Jinyoung Park	Dedekind’s Problem and beyond
Tue	Jan 02	07:30	Daniel McGinnis	Applications of the KKM theorem to problems in discrete geometry
Tue	Dec 19	07:30	Shengtong Zhang	TBA
Tue	Dec 12	07:30	Ting-Wei Chao	Tight Bound on Joints Problem and Partial Shadow Problem
Tue	Nov 28	07:30	Hyunwoo Lee	Towards a high-dimensional Dirac’s theorem
Tue	Nov 07	07:30	Bruce A. Reed	Some Variants of the Erdős-Sós Conjecture
Tue	Oct 31	07:30	James Davies	Odd distances in colourings of the plane
Tue	Oct 24	07:30	Robert Hickingbotham	Powers of planar graphs, product structure, and blocking partitions
Tue	Oct 17	07:30	Matija Bucić	Essentially tight bounds for rainbow cycles in proper edge-colourings
Tue	Oct 10	07:30	Domagoj Bradač	Effective bounds for induced size-Ramsey numbers of cycles
Tue	Sep 26	07:30	Carl R. Yerger	Solving Problems in Graph Pebbling using Optimization and Structural Techniques
Tue	Sep 19	07:30	Donggyu Kim (김동규)	Orthogonal matroids over tracts
Tue	Sep 12	07:30	Seog-Jin Kim	The square of every subcubic planar graph of girth at least 6 is 7-choosable
Tue	Sep 05	07:30	Sebastian Wiederrecht	Delineating half-integrality of the Erdős-Pósa property for minors
Tue	Aug 29	07:30	Dabeen Lee	TBA
Tue	Aug 22	07:30	Linda Cook	TBA
Wed	Aug 09	07:30	Amzi Jeffs	Intersection patterns of convex sets
Wed	Aug 02	07:30	Daniel Král'	High chromatic common graphs
Tue	Jul 25	07:30	Dong Yeap Kang	Hamilton cycles and optimal matchings in a random subgraph of uniform Dirac hypergraphs
Tue	Jul 18	07:30	Andrzej Grzesik	Rainbow Turán problems
Mon	Jul 10	07:30	Xuding Zhu	List version of 1-2-3 conjecture
Tue	Jul 04	07:30	Tuan Tran	Complexity of null dynamical systems
Tue	Jun 27	07:30	Chong Shangguan	The hat guessing number of graphs
Tue	Jun 20	07:30	Guanghui Wang	TBA
Tue	Jun 13	07:30	Minho Cho	Strong Erdős-Hajnal property on chordal graphs and its variants
Tue	May 30	07:30	Suyun Jiang	How connectivity affects the extremal number of trees
Tue	May 16	07:30	Oliver Janzer	Small subgraphs with large average degree
Tue	May 09	07:30	Jozef Skokan	Separating the edges of a graph by a linear number of paths
Tue	May 02	07:30	Rob Morris	An exponential improvement for diagonal Ramsey
Tue	Apr 25	07:30	Hyunwoo Lee	On perfect subdivision tilings
Tue	Apr 11	07:30	James Davies	Two structural results for pivot-minors
Tue	Apr 04	07:30	István Tomon	Configurations of boxes
Tue	Mar 28	07:30	Tianchi Yang	On the maximum number of edges in k-critical graphs
Tue	Mar 21	07:30	Younjin Kim	Problems on Extremal Combinatorics
Tue	Mar 14	07:30	Stijn Cambie	Recent progress on the Union-closed conjecture and related
Tue	Mar 07	07:30	Eunjin Oh	Parameterized algorithms for the planar disjoint paths problem
Tue	Feb 28	07:30	Maya Sankar	The Turán Numbers of Homeomorphs
Tue	Feb 21	07:30	Meike Hatzel	Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parametrised by the Size of the Cutset: Twin-Width Meets Flow-Augmentation
Tue	Feb 14	07:30	Raphael Steiner	Strengthening Hadwiger’s conjecture for 4- and 5-chromatic graphs
Tue	Jan 31	07:30	Abhishek Methuku	A proof of the Erdős–Faber–Lovász conjecture
Tue	Jan 17	07:30	Noleen Köhler	Twin-Width VIII: Delineation and Win-Wins
Tue	Jan 10	07:30	Mamadou Moustapha Kanté	TBA
Tue	Jan 03	07:30	Youngho Yoo	Approximating TSP walks in subcubic graphs
Wed	Dec 28	07:30	Stijn Cambie	The 69-conjecture and more surprises on the number of independent sets
Tue	Dec 06	07:30	Giannos Stamoulis	Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
Tue	Nov 22	07:30	Seonghyuk Im	A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Tue	Nov 15	07:30	Sebastian Wiederrecht	Excluding single-crossing matching minors in bipartite graphs
Tue	Nov 08	07:30	Jungho Ahn	Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Tue	Oct 18	07:30	Florent Koechlin	TBA
Tue	Oct 11	07:30	Nika Salia	Exact results for generalized extremal problems forbidding an even cycle
Tue	Oct 04	07:30	Zixiang Xu	On the degenerate Turán problems
Tue	Sep 27	07:30	Alexander Clifton	Ramsey Theory for Diffsequences
Tue	Sep 13	07:30	Sebastian Wiederrecht	Killing a vortex
Tue	Sep 06	07:30	Bjarne Schuelke	A local version of Katona’s intersection theorem
Tue	Aug 30	07:30	Jun Gao	Number of (k-1)-cliques in k-critical graph
Tue	Aug 23	07:30	Raul Wayne Teixeira Lopes	Temporal Menger and related problems
Tue	Aug 16	07:30	Noleen Köhler	Testing first-order definable properties on bounded degree graphs
Tue	Aug 09	07:30	Eun Jung Kim	Directed flow-augmentation
Mon	Aug 01	07:30	Seunghun Lee	Inscribable order types
Tue	Jul 19	05:00	Jinyoung Park	Thresholds 2/2
Mon	Jul 18	07:30	Jinyoung Park	Thresholds 1/2
Mon	Jul 11	07:30	Kevin Hendrey	TBA
Mon	Jul 04	07:30	Eric Vigoda	Computational phase transition and MCMC algorithms
Mon	Jun 27	07:30	Ben Lund	Radial projections in finite space
Mon	Jun 13	07:30	Amadeus Reinald	Twin-width and forbidden subdivisions
Mon	May 30	07:30	Hongseok Yang	TBA
Mon	May 23	07:30	Stijn Cambie	The precise diameter of reconfiguration graphs
Mon	May 16	07:30	Andreas Holmsen	A colorful version of the Goodman-Pollack-Wenger transversal theorem
Mon	May 09	07:30	Kyeongsik Nam	Large deviations for subgraph counts in random graphs
Mon	May 02	07:30	Cheolwon Heo	The complexity of the matroid-homomorphism problems
Mon	Apr 25	07:30	Boram Park	Odd coloring of sparse graphs
Mon	Apr 11	07:30	Younjin Kim	On the extremal problems related to Szemerédi’s theorem
Mon	Mar 28	07:30	Ben Lund	Thresholds for incidence properties in finite vector spaces
Mon	Mar 21	07:30	Jaehoon Kim	Ramsey numbers of cycles versus general graphs
Mon	Mar 14	07:30	Tuan Anh Do	Rank- and tree-width of supercritical random graphs
Mon	Feb 21	07:30	Donggyu Kim	A stronger version of Tutte’s wheel theorem for vertex-minors
Tue	Feb 15	07:30	Jinha Kim	Independent domination of graphs with bounded maximum degree
Tue	Jan 25	07:30	O-joung Kwon	Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Tue	Jan 18	07:30	Jaehyeon Seo	TBA
Tue	Jan 11	07:30	Andreas Holmsen	Some recent results on geometric transversals
Tue	Jan 04	07:30	Seunghun Lee	Transversals and colorings of simplicial spheres
Tue	Dec 14	07:30	Tuan Tran	Exponential decay of intersection volume with applications on list-decodability and sphere-covering bounds
Tue	Dec 07	07:30	Eun-Kyung Cho	Independent domination of graphs with bounded maximum degree
Tue	Nov 30	07:30	Seonghyuk Im	Large clique subdivisions in graphs without small dense subgraphs
Tue	Nov 23	07:30	Casey Tompkins	Ramsey numbers of Boolean lattices
Tue	Nov 09	07:30	Jaehoon Kim	2-complexes with unique embeddings in 3-space
Tue	Nov 02	07:30	Ben Lund	Maximal 3-wise intersecting families
Tue	Oct 26	07:30	Donggyu Kim	𝝘-graphic delta-matroids and their applications
Tue	Oct 12	07:30	Joonkyung Lee	Majority dynamics on sparse random graphs
Tue	Oct 05	07:30	Eunjin Oh	Feedback Vertex Set on Geometric Intersection Graphs
Tue	Sep 28	07:30	Kevin Hendrey	Extremal functions for sparse minors
Tue	Sep 07	07:30	Dabeen Lee	Mixing sets, submodularity, and chance-constrained optimization
Tue	Aug 31	07:30	Cheolwon Heo	TBA
Tue	Aug 24	07:30	Eun Jung Kim	A Constant-factor Approximation for Weighted Bond Cover
Tue	Aug 17	07:30	Linda Cook	Two results on graphs with holes of restricted lengths
Tue	Aug 10	07:30	Duksang Lee	Intertwining connectivities for vertex-minors and pivot-minors
Tue	Jul 27	06:00	Euiwoong Lee	The Karger-Stein algorithm is optimal for k-cut
Tue	Jul 20	07:30	Semin Yoo	Combinatorics of Euclidean spaces over finite fields
Tue	Jul 13	07:30	Jaehoon Kim	$K_{r+1}$-saturated graphs with small spectral radius
Tue	Jul 06	07:30	Suil O	Eigenvalues and [a, b]-factors in regular graphs
Tue	Jun 29	07:30	Jeong Ok Choi	Invertibility of circulant matrices of arbitrary size
Tue	Jun 22	07:30	Hongseok Yang	DAG-symmetries and Symmetry-Preserving Neural Networks
Tue	Jun 08	06:00	O-joung Kwon	Classes of intersection digraphs with good algorithmic properties
Tue	Jun 01	07:30	Doowon Koh	Mattila-Sjölin type functions: A finite field model
Tue	May 18	07:30	Pascal Gollin	TBA
Tue	May 11	07:30	Mark Siggers	The list switch homomorphism problem for signed graphs
Tue	Apr 27	07:30	Jungho Ahn	Well-partitioned chordal graphs with the obstruction set and applications
Tue	Apr 20	07:30	Sang-il Oum	What is an isotropic system?
Tue	Apr 06	07:30	Rutger Campbell	TBA
Tue	Mar 30	07:30	Casey Tompkins	3-uniform hypergraphs avoiding a cycle of length four
Mon	Mar 22	07:30	Hong Liu	Nested cycles with no geometric crossing
Tue	Mar 16	07:30	Se-Young Yun	Regret in Online Recommendation Systems
Tue	Mar 09	07:30	Debsoumya Chakraborti	Some classical problems in graph saturation
Tue	Mar 02	07:30	Kevin Hendrey	A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
Tue	Feb 09	07:30	Doowon Koh	On the cone restriction conjecture in four dimensions and applications in incidence geometry
Tue	Jan 26	07:30	Tuan Tran	Minimum saturated families of sets
Tue	Jan 19	07:30	Ben Lund	Perfect matchings and derangements on graphs
Tue	Jan 12	07:30	Andreas Holmsen	Discrete geometry in convexity spaces
Tue	Jan 05	07:30	O-joung Kwon	Directed tangles and applications
Tue	Dec 22	07:30	Jinha Kim	On a conjecture by Kalai and Meshulam – the Betti number of the independence complex of ternary graphs
Tue	Dec 08	07:30	Hong Liu	A solution to Erdős and Hajnal’s odd cycle problem
Tue	Dec 01	07:30	Debsoumya Chakraborti	Rainbow matchings in edge-colored simple graphs
Tue	Nov 24	07:30	Duksang Lee	Characterizing matroids whose bases form graphic delta-matroids
Tue	Nov 10	07:30	Casey Tompkins	Extremal forbidden poset problems in Boolean and linear lattices
Tue	Nov 03	07:30	Jaeseong Oh	A 2-isomorphism theorem for delta-matroids
Tue	Oct 27	07:30	Jeong Ok Choi	Various game-theoretic models on graphs
Wed	Oct 21	07:30	Joonkyung Lee	On graph norms for complex-valued functions
Tue	Sep 29	07:30	Minki Kim	Complexes of graphs with bounded independence number
Tue	Sep 22	07:30	Jinha Kim	Collapsibility of Non-Cover Complexes of Graphs
Tue	Sep 15	07:30	Debsoumya Chakraborti	Maximum number of cliques in a graph with bounded maximum degree
Tue	Sep 08	07:30	Rutger Campbell	Disasters in abstracting combinatorial properties of linear dependence
Tue	Aug 25	07:30	Ben Lund	Point-plane incidence bounds
Tue	Aug 18	07:30	Tuan Tran	Anti-concentration phenomena
Tue	Aug 11	07:30	Yunbum Kook	Vertex Sparsification for Edge Connectivity
Tue	Aug 04	07:30	June Huh	Kazhdan-Lusztig polynomials of graphs and matroids
Tue	Jul 28	07:30	Eun Jung Kim	Solving hard cut problems via flow-augmentation
Tue	Jul 21	07:30	Ilkyoo Choi	Flexibility of Planar Graphs
Tue	Jul 14	07:30	Casey Tompkins	Inverse Turán problems
Tue	Jul 07	07:30	Seog-Jin Kim	Online DP-coloring of graphs
Tue	Jun 30	07:30	Dennis Wong	Generating Gray codes and universal cycles for weak orders
Tue	Jun 23	07:30	Jaehoon Kim	A resilience version of Pósa’s theorem
Tue	Jun 16	07:30	Andreas Holmsen	Fractional Helly and topological complexity
Tue	Jun 09	07:30	Jiseung Kim	Hardness and concrete security in cryptography
Tue	Jun 02	07:30	Huy-Tung Nguyen	The average cut-rank of graphs
Tue	May 26	07:30	Hong Liu	Asymptotic structure for the clique density theorem
Tue	May 19	07:30	O-joung Kwon	Mim-width: a width parameter beyond rank-width
Tue	May 12	07:30	Eun Jung Kim	Twin-width: tractable FO model checking
Tue	Apr 28	07:30	Seunghun Lee	Leray numbers of complexes of graphs with bounded matching number
Tue	Apr 21	07:30	Sang-il Oum	Survey on vertex-minors
Tue	Apr 14	07:30	Casey Tompkins	Saturation problems in the Ramsey theory of graphs, posets and point sets

Embed this schedule

Export series to