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	Aug 10	07:30	Eun Jung Kim	A Constant-factor Approximation for Weighted Bond Cover
Tue	Aug 17	07:30	Linda Cook	TBA
Tue	Aug 24	07:30	Duksang Lee	Intertwining connectivities for vertex-minors and pivot-minors
Tue	Aug 31	07:30	Ilkyoo Choi	On independent domination of regular graphs
Tue	Sep 07	07:30	Sang-hyun Kim	On rational 2x2 matrices without relations
Tue	Sep 14	07:30	Cheolwon Heo	TBA

Embed this schedule

Your time			Speaker	Title
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