IBS Virtual Discrete Math Colloquium

External homepage

computer science theory combinatorics

Institute for Basic Science

Audience: Researchers in the topic
Seminar series times: Wednesday 07:30-08:30, Thursday 01:00-02:00 in your time zone, UTC
Organizers: O-joung Kwon*, Joonkyung Lee, Jaehoon Kim
Curators: Sang-il Oum*, Hong Liu
*contact for this listing

Please check the website for the abstract and the Zoom information.

Upcoming talks
Past talks
Your timeSpeakerTitle
WedMay 1707:00Szymon ToruńczykFlip-width: Cops and Robber on dense graphs
WedApr 1907:30Shin-ichiro SekiOn the extension of the Green-Tao theorem to number fields
ThuApr 0601:00Jie HanSpanning trees in expanders
WedMar 2207:30Qizhong LinTwo classical Ramsey-Turán numbers involving triangles
ThuMar 1601:00Paul SeymourA loglog step towards the Erdős-Hajnal conjecture
ThuMar 0901:00Marcelo SalesOn Pisier type problems
WedFeb 2208:00Daniel AltmanOn an arithmetic Sidorenko conjecture, and a question of Alon
WedFeb 1507:30Robert HickingbothamTreewidth, Circle Graphs and Circular Drawings
WedFeb 0107:30Benjamin BergougnouxTight Lower Bounds for Problems Parameterized by Rank-width
WedJan 2507:30Jan HladkýInvitation to graphons
ThuJan 1901:00Pedro MontealegreA Meta-Theorem for Distributed Certification
ThuDec 1501:00Maya SankarHomotopy and the Homomorphism Threshold of Odd Cycles
ThuDec 0101:00Cosmin PohoaConvex polytopes from fewer points
ThuNov 1701:00Chong ShangguanOn the sparse hypergraph problem of Brown, Erdős and Sós
WedNov 0907:30Hugo JacobOn the parameterized complexity of computing tree-partitions
ThuOct 0601:00Konstantin TikhomirovA remark on the Ramsey number of the hypercube
ThuSep 2901:00Santiago Guzmán-ProLocal expressions of graphs classes
WedSep 2107:30Mehtaab SawhneyAnticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
WedSep 0707:30Dömötör PálvölgyiC-P3O: Orientation of convex sets and other good covers
WedAug 3107:30Raphael SteinerCongruence-constrained subdivisions in digraphs
ThuAug 2501:00Brett LerouxExpansion of random 0/1 polytopes
WedAug 1007:30Akash KumarRandom walks and Forbidden Minors
WedAug 0307:30Lars JaffkeTaming graphs with no large creatures and skinny ladders
WedJul 2707:30Noam LifshitzProduct free sets in the alternating group
ThuJul 0701:00Sepehr HajebiHoles, hubs and bounded treewidth
WedJun 2907:30Xizhi LiuHypergraph Turán problem: from 1 to ∞
WedJun 2207:30Chengfei XieOn the packing densities of superballs in high dimensions
ThuJun 0201:30Jeck LimSums of linear transformations
WedMay 2507:30Sebastian SiebertzTransducing paths in graph classes with unbounded shrubdepth
WedMay 1807:30Jan KurkofkaCanonical Graph Decompositions via Coverings
WedApr 2707:30Michael SaveryTBA
WedApr 1307:30Jakub GajarskýModel Checking on Interpretations of Classes of Bounded Local Clique-Width
WedMar 3007:30Jean-Florent RaymondLong induced paths in minor-closed graph classes and beyond
ThuMar 1007:30Fedor FominLong cycles in graphs: Extremal Combinatorics meets Parameterized Algorithms
FriFeb 1801:00Manuel LafondRecognizing k-leaf powers in polynomial time, for constant k
ThuFeb 1007:30James DaviesSeparating polynomial χ-boundedness from χ-boundedness
ThuJan 2707:30Bo NingSubstructures and eigenvalues of graphs: Triangles and quadrilaterals
ThuJan 2007:30Ken-ichi KawarabayashiToward Directed Graph Minor Theory
ThuJan 1307:30Ron AharoniA strong version of the Caccetta-Haggkvist conjecture
ThuDec 0907:30David Munhá CorreiaRainbow matchings
ThuNov 2507:30Tuukka KorhonenFast FPT-Approximation of Branchwidth
ThuNov 1107:30Sebastian WiederrechtMatching Minors in Bipartite Graphs
FriNov 0507:30Martin MilaničTree Decompositions with Bounded Independence Number
FriOct 0801:00Paul SeymourPolynomial bounds for chromatic number
ThuSep 3007:30Péter Pál PachThe Alon-Jaeger-Tarsi conjecture via group ring identities
WedAug 1808:00Petr HliněnýTwin-width is linear in the poset width
WedJul 2806:00Maria ChudnovskyInduced subgraphs and tree decompositions
WedJul 1408:00Stefan WeltgeInteger programs with bounded subdeterminants and two nonzeros per row
WedJun 3008:00Florian Gut and Attila JoóLarge vertex-flames in uncountable digraphs
WedJun 1608:00Alan LewRepresentability and boxicity of simplicial complexes
WedJun 0208:00Adam Zsolt WagnerConstructions in combinatorics via neural networks
WedMay 2608:00Dimitrios M. ThilikosBounding Obstructions sets: the cases of apices of minor closed classes
FriMay 2108:00Benjamin BumpusDirected branch-width: A directed analogue of tree-width
WedMay 1208:00Johannes CarmesinA Whitney type theorem for surfaces: characterising graphs with locally planar embeddings
ThuMay 0601:00Raul LopesAdapting the Directed Grid Theorem into an FPT Algorithm
WedApr 2108:00Reinhard DiestelTangles of set separations: a novel clustering method and type recognition in machine learning
WedApr 1408:00István TomonRamsey properties of semilinear graphs
WedApr 0708:00Michał PilipczukStructural properties of powers of sparse graphs
ThuApr 0101:00Sophie SpirklPure pairs in ordered graphs
WedMar 2408:00Édouard BonnetTwin-width and ordered binary structures
WedMar 1708:00Yixin CaoRecognizing (unit) interval graphs by zigzag graph searches
WedFeb 1701:00David WoodTree densities of sparse graph classes
WedFeb 1007:30Jie MaNon-repeated cycle lengths and Sidon sequences
WedFeb 0307:30Ron AharoniColorful KKM and multiple cakes division
WedJan 2701:00Dong Yeap KangA proof of the Erdős-Faber-Lovász conjecture
WedJan 2007:30Yusuke KobayashiAn FPT Algorithm for Minimum Additive Spanner Problem
WedJan 1301:00Rose McCartyTBA
WedDec 3001:00Paul SeymourThe Erdős-Hajnal conjecture is true for excluding a five-cycle
ThuDec 1701:00Jaiung JunOn the Hopf algebra of multi-complexes
WedDec 0907:30Karl HeuerEven Circuits in Oriented Matroids
ThuDec 0307:30Deniz SarikayaWhat means Hamiltonicity for infinite graphs and how to force it via forbidden induced subgraphs
ThuNov 2601:00Da Qi ChenBipartite saturation
ThuNov 1907:30Yijia ChenGraphs of bounded shrub-depth, through a logic lens
WedNov 1107:30Meike HatzelConstant congestion bramble
ThuNov 0501:00Daniel CranstonVertex Partitions into an Independent Set and a Forest with Each Component Small
ThuOct 2201:00Chun-Hung LiuAsymptotic dimension of minor-closed families and beyond
ThuSep 2401:00Zihan TanTowards Tight(er) Bounds for the Excluded Grid Theorem
ThuSep 1701:00Luke PostleFurther progress towards Hadwiger’s conjecture
ThuSep 1008:10Sebastian SiebertzRank-width meets stability
WedAug 2601:30Nick BrettellOn the graph width parameter mim-width
WedAug 1907:30Gwenaël JoretPacking and covering balls in graphs excluding a minor
WedAug 0507:30Robert GanianSolving Integer Linear Programs by Exploiting Variable-Constraint Interactions
WedJul 2907:30Akanksha AgrawalPolynomial Kernel for Interval Vertex Deletion
WedJul 2207:30Paloma T. LimaGraph square roots of small distance from degree one graphs
Embed this schedule
Export series to