- Видео 225
- Просмотров 125 136
IBS Discrete Mathematics Group
Южная Корея
Добавлен 3 янв 2019
IBS Discrete Mathematics Group (DIMAG) is one of the research groups in the Center for Mathematical and Computational Sciences in the Institute for Basic Science, led by its Chief Investigator Sang-il Oum, a KAIST endowed chair professor in Mathematical Sciences. Established in December 2018, DIMAG is located on the 3rd floor of the Theory Building of the IBS HQ, Daejeon, South Korea with the IBS Extremal Combinatorics and Probability Group.
기초과학연구원 이산수학그룹 (IBS Discrete Mathematics Group, DIMAG)은 기초과학연구원(IBS) 수리 및 계산 과학 연구단 내에 속한 연구 그룹 중 하나로, 엄상일 CI (KAIST 지정석좌교수)가 책임을 맡고 있습니다. 2018년 12월에 설립된 이산수학그룹은 대전 IBS 본원 이론동 3층에 기초과학연구원 극단 조합 및 확률 그룹(IBS Extremal Combinatorics and Probability Group)과 함께 위치하고 있습니다.
기초과학연구원 이산수학그룹 (IBS Discrete Mathematics Group, DIMAG)은 기초과학연구원(IBS) 수리 및 계산 과학 연구단 내에 속한 연구 그룹 중 하나로, 엄상일 CI (KAIST 지정석좌교수)가 책임을 맡고 있습니다. 2018년 12월에 설립된 이산수학그룹은 대전 IBS 본원 이론동 3층에 기초과학연구원 극단 조합 및 확률 그룹(IBS Extremal Combinatorics and Probability Group)과 함께 위치하고 있습니다.
2020-12-30 Paul Seymour, The Erdős-Hajnal conjecture is true for excluding a five-cycle
2020-12-30 Paul Seymour, The Erdős-Hajnal conjecture is true for excluding a five-cycle
Просмотров: 1 286
Видео
2020-04-14 Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
Просмотров 4214 года назад
2020-04-14 Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
2020-03-03 Eun-Kyung Cho, Decomposition of a planar graph into a d-degenerate graph and a graph ...
Просмотров 2924 года назад
2020-03-03 Eun-Kyung Cho, Decomposition of a planar graph into a d-degenerate graph and a graph ...
2020-02-25 Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
Просмотров 1664 года назад
2020-02-25 Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
2020-01-28 Dillon Mayhew, Courcelle’s Theorem for hypergraphs
Просмотров 2574 года назад
2020-01-28 Dillon Mayhew, Courcelle’s Theorem for hypergraphs
2020-01-20 Adam Zsolt Wagner, The largest projective cube-free subsets of $Z_{2^n}$
Просмотров 2614 года назад
2020-01-20 Adam Zsolt Wagner, The largest projective cube-free subsets of $Z_{2^n}$
2020-01-15 Ben Lund, Furstenberg sets over finite fields
Просмотров 954 года назад
2020-01-15 Ben Lund, Furstenberg sets over finite fields
2020-01-14 Sanjeeb Dash, Boolean decision rules via column generation
Просмотров 2454 года назад
2020-01-14 Sanjeeb Dash, Boolean decision rules via column generation
2019-12-19 Attila Joó, Base partition for finitary-cofinitary matroid families
Просмотров 784 года назад
2019-12-19 Attila Joó, Base partition for finitary-cofinitary matroid families
2019-12-10 Jakub Gajarský, First-order interpretations of bounded expansion classes
Просмотров 894 года назад
2019-12-10 Jakub Gajarský, First-order interpretations of bounded expansion classes
2019-11-19 Ruth Luo, Induced Turán problems for hypergraphs
Просмотров 3284 года назад
2019-11-19 Ruth Luo, Induced Turán problems for hypergraphs
2019-11-21 Frédéric Meunier, Topological bounds for graph representations over any field
Просмотров 1384 года назад
2019-11-21 Frédéric Meunier, Topological bounds for graph representations over any field
2019-11-12 Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
Просмотров 1504 года назад
2019-11-12 Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
2019-10-29 Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Просмотров 1094 года назад
2019-10-29 Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
2019-10-22 Joonkyung Lee (이준경), On some properties of graph norms
Просмотров 1874 года назад
2019-10-22 Joonkyung Lee (이준경), On some properties of graph norms
2019-10-15 Zi Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
Просмотров 1794 года назад
2019-10-15 Zi Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
2019-10-01 Casey Tompkins, Extremal problems for Berge hypergraphs
Просмотров 1364 года назад
2019-10-01 Casey Tompkins, Extremal problems for Berge hypergraphs
2019-10-10 Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
Просмотров 2834 года назад
2019-10-10 Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
2019-09-19 Cory Palmer, A survey of Turán type subgraph counting problems
Просмотров 554 года назад
2019-09-19 Cory Palmer, A survey of Turán type subgraph counting problems
2019-09-10 Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Просмотров 834 года назад
2019-09-10 Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
2019-08-20 Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
Просмотров 1604 года назад
2019-08-20 Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
2019-08-12 Hong Liu (刘鸿), Recent advance in Ramsey-Turán theory
Просмотров 1964 года назад
2019-08-12 Hong Liu (刘鸿), Recent advance in Ramsey-Turán theory
2019-08-12 Péter Pál Pach, On some applications of graph theory to number theoretic problems
Просмотров 654 года назад
2019-08-12 Péter Pál Pach, On some applications of graph theory to number theoretic problems
2019-08-12 Jaehoon Kim (김재훈), Tree decompositions of graphs without large bipartite holes
Просмотров 1614 года назад
2019-08-12 Jaehoon Kim (김재훈), Tree decompositions of graphs without large bipartite holes
2019-08-02 Dabeen Lee (이다빈), t-perfect graphs and the stable set problem
Просмотров 1674 года назад
2019-08-02 Dabeen Lee (이다빈), t-perfect graphs and the stable set problem
2019-08-01 Euiwoong Lee (이의웅), Losing treewidth by separating subsets
Просмотров 1834 года назад
2019-08-01 Euiwoong Lee (이의웅), Losing treewidth by separating subsets
2019-08-01 Sang-il Oum (엄상일), Branch depth: Generalizing tree depth of graphs
Просмотров 1474 года назад
2019-08-01 Sang-il Oum (엄상일), Branch depth: Generalizing tree depth of graphs
2019-07-29 Archontia Giannopoulou, The directed flat wall theorem
Просмотров 2194 года назад
2019-07-29 Archontia Giannopoulou, The directed flat wall theorem
2019-07-31 Édouard Bonnet, The FPT/W[1]-hard dichotomy of Max Independent Set in H free graphs
Просмотров 1644 года назад
2019-07-31 Édouard Bonnet, The FPT/W[1]-hard dichotomy of Max Independent Set in H free graphs
2019-07-31 Magnus Wahlström, FPT algorithms via LP relaxations
Просмотров 834 года назад
2019-07-31 Magnus Wahlström, FPT algorithms via LP relaxations
Anlaşıldı hocam 🐻
Hocam Türkçe meali ne zaman gelir
tekrar anlatır mısınız anlamadım
hello, can you send me your slides about this lesson? thankyou
감명깊게 들었습니다. 박사님.😊
이러니까 선대시험난이도가 ....ㅋㅋㅋ ㅜㅜㅜ
good stuff yeti
Why is he mumbling so much
지금 초등학교 3학년 산수시간인거 맞죠 ? ? ? ㅠㅠ
두근 거리며 댓글창을 열었지만…
wow
How?
Thank you too
아유뽀리너? 아이돈노잉글리쉬
감사합니다
Hope for the talk of Hong Liu on 9.14
승승장구하는 수학자 되세요~~
the speaker is very intelligent and cute
Hi abhishek I am pavan from st.pauls . Nice lecture ra ☺
Yêu con .
I can't believe it can be this good
Great talk!
헐ㅋㅋㅋ...
A correction. The second author of the result at 17:00 on the lower bound of R(Q2,Qn) is Christian Winter. I have mixed it up with Walzer from the earlier results.
So we can say that isotropic = same on all the directions If am I wrong then please correct me.
Oh wow. Interesting!
After I presented the talk, Benjamin Bergougnoux commented me that the claim of (Boyaci, Ekim, Shalom 17) that there is a polynomial-time algorithm for Max Cut on proper interval graphs at 1:02:40 was recently disproved by Kratochvíl, Masařík, and Novotná (arxiv.org/pdf/2002.08311.pdf). I would like to thank Benjamin for the comment.