Younjin Kim (김연진), On the extremal problems related to Szemerédi’s theorem
Room B232 IBS (기초과학연구원)In 1975, Szemerédi proved that for every real number
5 events found.
ECOPRO
Boram Park (박보람), Odd coloring of sparse graphs
Room B232 IBS (기초과학연구원)We introduce an odd coloring of a graph, which was introduced very recently, motivated by parity type colorings of graphs. A proper vertex coloring of graph
Cheolwon Heo (허철원), The complexity of the matroid-homomorphism problems
Room B332 IBS (기초과학연구원)In this talk, we introduce homomorphisms between binary matroids that generalize graph homomorphisms. For a binary matroid
Kyeongsik Nam (남경식), Large deviations for subgraph counts in random graphs
Room B332 IBS (기초과학연구원)The upper tail problem for subgraph counts in the Erdos-Renyi graph, introduced by Janson-Ruciński, has attracted a lot of attention. There is a class of Gibbs measures associated with subgraph counts, called exponential random graph model (ERGM). Despite its importance, lots of fundamental questions have remained unanswered owing to the lack of exact solvability. In …
Hongseok Yang (양홍석), Learning Symmetric Rules with SATNet
Room B332 IBS (기초과학연구원)SATNet is a differentiable constraint solver with a custom backpropagation algorithm, which can be used as a layer in a deep-learning system. It is a promising proposal for bridging deep learning and logical reasoning. In fact, SATNet has been successfully applied to learn, among others, the rules of a complex logical puzzle, such as Sudoku, …