{"id":3370,"date":"2022-11-08T13:12:37","date_gmt":"2022-11-08T04:12:37","guid":{"rendered":"https:\/\/www.ibs.re.kr\/ecopro\/?page_id=3370"},"modified":"2023-06-12T17:12:51","modified_gmt":"2023-06-12T08:12:51","slug":"student-reading-2022","status":"publish","type":"page","link":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/","title":{"rendered":"Student Reading"},"content":{"rendered":"\n<p>ECOPRO and DIMAG students regularly read some recent combinatorics papers<\/p>\n\n\n\n<p class=\"has-white-background-color has-background\">Time: Mon 4:00~5:30 (KST)<br>Place: IBS Room 332 (If one asks, we will also stream via zoom)<\/p>\n\n\n\n<p style=\"font-size:30px\"><strong><em>Upcoming<\/em><\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>We have a vacation!<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<p style=\"font-size:30px\"><strong><em>Presented<\/em><\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>(23\/06\/12, Seonghyuk) On the mean square displacement of a random walk on a graph, <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0195669815001262\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/06\/05, Seonghyuk) On the choosability of\u00a0H-minor-free graphs, <a href=\"https:\/\/arxiv.org\/abs\/2304.04246\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/05\/22, Junhyeok) Rainbow Hamiltonicity in uniformly coloured perturbed graphs, <a href=\"https:\/\/arxiv.org\/abs\/2304.09155\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/05\/15, Myounghwan) A new width parameter of graphs based on edge cuts, <a href=\"https:\/\/arxiv.org\/abs\/2302.04624\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/05\/08, Minseo) Packings in Dense Regular Graphs, <a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\/article\/packings-in-dense-regular-graphs\/23C7120D8A02BF1CA885FFD5C0AC2632\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/05\/01, Junhyeok) Independence testing for inhomogeneous random graphs, <a href=\"https:\/\/arxiv.org\/abs\/2304.09132\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/04\/24, Donggyu) Geometric algebra of combinatorial geomtries, <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/0001870889900133\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/04\/17, Seonghyuk) Hypergraph Tur\u00b4an densities can have arbitrarily large algebraic degree, <a href=\"https:\/\/arxiv.org\/pdf\/2207.05576.pdf\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/04\/10, Junhyeok) Cycles of many lengths in Hamiltonian graphs, <a href=\"https:\/\/arxiv.org\/abs\/2104.07633\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/04\/03, Jaehyeon) An exponential improvement for diagonal Ramsey, <a href=\"https:\/\/arxiv.org\/abs\/2303.09521\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/03\/27, Seokbum) A note on the Gy\u00e1rf\u00e1s-Sumner conjecture, <a href=\"https:\/\/arxiv.org\/abs\/2302.08922\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/03\/20, Seonghyuk) Equiangular lines with a fixed angle, <a href=\"http:\/\/Equiangular lines with a fixed angle\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/03\/13, Hyunwoo) SETS WITHOUT k-TERM PROGRESSIONS CAN HAVE MANY SHORTER PROGRESSIONS, <a href=\"https:\/\/arxiv.org\/abs\/1908.09905\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/02\/17, Seonghyuk) The Minimum Degree Removal Lemma Thresholds, <a href=\"https:\/\/arxiv.org\/abs\/2301.13789\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/02\/10, Junhyeok) The critical window for the classical Ramsey-Tur\u00e1n problem, <a href=\"https:\/\/arxiv.org\/abs\/1208.3276\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/02\/03, Jaehyeon) The rainbow saturation number is linear, <a href=\"https:\/\/arxiv.org\/abs\/2211.08589\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/01\/27, Junhyeok) On the size-Ramsey number of cycles, <a href=\"https:\/\/arxiv.org\/abs\/1701.07348\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/01\/20, Seonghyuk) Quasirandom forcing orientations of cycles, <a href=\"https:\/\/arxiv.org\/abs\/2212.0934\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/01\/13, Junhyeok) A note on the trace method for random regular graphs, <a href=\"https:\/\/arxiv.org\/abs\/2006.13605\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(23\/01\/06, Hyunwoo) Squaring a Tournament: A Proof of Dean\u2019s Conjecture, <a href=\"https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/(SICI)1097-0118(199609)23:1%3C43::AID-JGT4%3E3.0.CO;2-K\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/12\/16, Seokbum) Towards the Erd\u0151s-Hajnal conjecture for P5-free graphs, <a href=\"https:\/\/arxiv.org\/abs\/2210.10755\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/12\/09, Junhyeok) Cats in cubes, <a href=\"https:\/\/arxiv.org\/abs\/2211.14887\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/12\/02, Seonghyuk) A note on estimating global subgraph counts by sampling, <a href=\"https:\/\/arxiv.org\/abs\/2210.11336\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">link<\/a><\/li>\n\n\n\n<li>(22\/11\/25, Hyunwoo) Where have all the grasshoppers gone?, <a href=\"https:\/\/arxiv.org\/abs\/2211.03870\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/11\/18, Donggyu) Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid, <a href=\"https:\/\/arxiv.org\/abs\/1811.01816\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/11\/11, Jaehyeon) Graphs without a rainbow path of length 3, <a href=\"https:\/\/arxiv.org\/abs\/2211.02308\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/11\/04, Seonghyuk) Extremal graphs without exponentially-small bicliques, <a href=\"https:\/\/arxiv.org\/abs\/2107.04167\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/10\/28, Hyunwoo) Degree versions of the Erd\u0151s\u2013Ko\u2013Rado theorem and Erd\u0151s hypergraph matching conjecture, <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S009731651730033X\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/10\/21, Seonghyuk) The spectral even cycle problem, <a href=\"https:\/\/arxiv.org\/abs\/2205.00990\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n\n\n\n<li>(22\/10\/14, Hyunwoo) The limit in the (k + 2, k)-Problem of Brown, Erd\\H{o}s and S\\'{o}s exists for all k \u2265 2, <a href=\"https:\/\/arxiv.org\/abs\/2210.01105\" target=\"_blank\" rel=\"noreferrer noopener\">link<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>ECOPRO and DIMAG students regularly read some recent combinatorics papers Time: Mon 4:00~5:30 (KST)Place: IBS Room 332 (If one asks, we will also stream via zoom) Upcoming Presented<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":"","_price":"","_stock":"","_tribe_ticket_header":"","_tribe_default_ticket_provider":"","_tribe_ticket_capacity":"0","_ticket_start_date":"","_ticket_end_date":"","_tribe_ticket_show_description":"","_tribe_ticket_show_not_going":false,"_tribe_ticket_use_global_stock":"","_tribe_ticket_global_stock_level":"","_global_stock_mode":"","_global_stock_cap":"","_tribe_rsvp_for_event":"","_tribe_ticket_going_count":"","_tribe_ticket_not_going_count":"","_tribe_tickets_list":"[]","_tribe_ticket_has_attendee_info_fields":false,"footnotes":"","_tec_slr_enabled":"","_tec_slr_layout":""},"class_list":["post-3370","page","type-page","status-publish","hentry"],"featured_image_src":null,"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Student Reading - Extremal Combinatorics and Probability Group<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Student Reading - Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"og:description\" content=\"ECOPRO and DIMAG students regularly read some recent combinatorics papers Time: Mon 4:00~5:30 (KST)Place: IBS Room 332 (If one asks, we will also stream via zoom) Upcoming Presented\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/\" \/>\n<meta property=\"og:site_name\" content=\"Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"article:modified_time\" content=\"2023-06-12T08:12:51+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/student-reading-2022\\\/\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/student-reading-2022\\\/\",\"name\":\"Student Reading - Extremal Combinatorics and Probability Group\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#website\"},\"datePublished\":\"2022-11-08T04:12:37+00:00\",\"dateModified\":\"2023-06-12T08:12:51+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/student-reading-2022\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/student-reading-2022\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/student-reading-2022\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Student Reading\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#website\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/\",\"name\":\"Extremal Combinatorics and Probability Group\",\"description\":\"\uae30\ucd08\uacfc\ud559\uc5f0\uad6c\uc6d0 \uadf9\ub2e8 \uc870\ud569 \ubc0f \ud655\ub960 \uadf8\ub8f9\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#organization\",\"name\":\"IBS Extremal Combinatorics and Probability Group\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/wp-content\\\/uploads\\\/2022\\\/01\\\/ibs-ecopro-logo.png\",\"contentUrl\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/wp-content\\\/uploads\\\/2022\\\/01\\\/ibs-ecopro-logo.png\",\"width\":784,\"height\":197,\"caption\":\"IBS Extremal Combinatorics and Probability Group\"},\"image\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#\\\/schema\\\/logo\\\/image\\\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Student Reading - Extremal Combinatorics and Probability Group","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/","og_locale":"en_US","og_type":"article","og_title":"Student Reading - Extremal Combinatorics and Probability Group","og_description":"ECOPRO and DIMAG students regularly read some recent combinatorics papers Time: Mon 4:00~5:30 (KST)Place: IBS Room 332 (If one asks, we will also stream via zoom) Upcoming Presented","og_url":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/","og_site_name":"Extremal Combinatorics and Probability Group","article_modified_time":"2023-06-12T08:12:51+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/","url":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/","name":"Student Reading - Extremal Combinatorics and Probability Group","isPartOf":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/#website"},"datePublished":"2022-11-08T04:12:37+00:00","dateModified":"2023-06-12T08:12:51+00:00","breadcrumb":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.ibs.re.kr\/ecopro\/student-reading-2022\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.ibs.re.kr\/ecopro\/"},{"@type":"ListItem","position":2,"name":"Student Reading"}]},{"@type":"WebSite","@id":"https:\/\/www.ibs.re.kr\/ecopro\/#website","url":"https:\/\/www.ibs.re.kr\/ecopro\/","name":"Extremal Combinatorics and Probability Group","description":"\uae30\ucd08\uacfc\ud559\uc5f0\uad6c\uc6d0 \uadf9\ub2e8 \uc870\ud569 \ubc0f \ud655\ub960 \uadf8\ub8f9","publisher":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.ibs.re.kr\/ecopro\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.ibs.re.kr\/ecopro\/#organization","name":"IBS Extremal Combinatorics and Probability Group","url":"https:\/\/www.ibs.re.kr\/ecopro\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.ibs.re.kr\/ecopro\/#\/schema\/logo\/image\/","url":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2022\/01\/ibs-ecopro-logo.png","contentUrl":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2022\/01\/ibs-ecopro-logo.png","width":784,"height":197,"caption":"IBS Extremal Combinatorics and Probability Group"},"image":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/#\/schema\/logo\/image\/"}}]}},"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false,"dimag-thumbnail":false,"twentyseventeen-featured-image":false,"twentyseventeen-thumbnail-avatar":false},"uagb_author_info":{"display_name":"seonghyuk","author_link":"https:\/\/www.ibs.re.kr\/ecopro\/author\/seonghyuk\/"},"uagb_comment_info":0,"uagb_excerpt":"ECOPRO and DIMAG students regularly read some recent combinatorics papers Time: Mon 4:00~5:30 (KST)Place: IBS Room 332 (If one asks, we will also stream via zoom) Upcoming Presented","jetpack_sharing_enabled":true,"ticketed":false,"_links":{"self":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3370","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/comments?post=3370"}],"version-history":[{"count":33,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3370\/revisions"}],"predecessor-version":[{"id":3946,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3370\/revisions\/3946"}],"wp:attachment":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/media?parent=3370"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}