Lars Jaffke, A complexity dichotomy for critical values of the b-chromatic number of graphs
Room B232 IBS (기초과학연구원)A
10 events found.
Jinyoung Park (박진영), The number of maximal independent sets in the Hamming cube
Room B232 IBS (기초과학연구원)Let
Suil O (오수일), An odd [1,b]-factor in regular graphs from eigenvalues
Room B232 IBS (기초과학연구원)An odd $$-factor of a graph is a spanning subgraph
Patrice Ossona de Mendez, A model theoretical approach to sparsity
Room B232 IBS (기초과학연구원)We discuss how the model theoretic notion of first-order transduction allows to define a notion of structural sparsity, and give some example of applications, like existence of low shrub-depth decompositions for tranductions of bounded expansion classes, characterization of transductions of classes with bounded pathwidth, decompositions of graphs with bounded rank-width into cographs.
Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors
Room B232 IBS (기초과학연구원)Given a finite set of elements
2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures
Room B232 IBS (기초과학연구원)Schedule July 22 Monday 10:00-11:00 Introduction, 11:00-12:00 Open Problems July 23 Tuesday 10:00-10:30 Stefan Kratsch, Humboldt-Universität zu Berlin, Germany Elimination Distances, Blocking Sets, and Kernels for Vertex Cover 10:45-11:15 Benjamin Bergougnoux, University Clermont Auvergne, France More applications of the d-neighbor equivalence 11:30-12:00 Yixin Cao, Hong Kong Polytechnic University, China Enumerating Maximal Induced Subgraphs 13:30-14:30 Open Problems …
2019-2 IBS One-Day Conference on Extremal Graph Theory
Room B232 IBS (기초과학연구원)Invited Speakers Jaehoon Kim (김재훈), KAIST Hong Liu (刘鸿), University of Warwick Abhishek Methuku, IBS Discrete Mathematics Group Péter Pál Pach, Budapest University of Technology and Economics Schedule August 12, Monday 11:00am-12:00pm Jaehoon Kim (김재훈): Tree decompositions of graphs without large bipartite holes 12:00pm-1:30pm Lunch 1:30pm-2:30pm Abhishek Methuku: Bipartite Turán problems for ordered graphs 3:00pm-4:00pm Péter Pál …
2019 Combinatorics Workshop
Hotel Skypark, Songdo, Incheon, Korea (송도 스카이파크호텔)The annual conference on Combinatorics Workshop (조합론 학술대회) began in 2004 by the Yonsei University BK21 Research Group. This year it will take place in Songdo, Incheon, August 13-15, 2019. Due to the capacity (50 persons) of the place, we are able to limit your registration. In principle, registration is on a first-come, first-served basis. …
Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
Room B232 IBS (기초과학연구원)In this talk we shall discuss how quickly the genus of the Erdős-Rényi random graph grows as the number of edges increases and how dramatically a small number of random edges can increase the genus of a randomly perturbed graph. (Joint work with Chris Dowden and Michael Krivelevich)
Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Room B232 IBS (기초과학연구원)Given a graph