{"id":3736,"date":"2023-02-07T08:45:12","date_gmt":"2023-02-06T23:45:12","guid":{"rendered":"https:\/\/www.ibs.re.kr\/ecopro\/?page_id=3736"},"modified":"2023-03-07T09:55:43","modified_gmt":"2023-03-07T00:55:43","slug":"reading-spring-2023","status":"publish","type":"page","link":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/","title":{"rendered":"Reading Spring 2023"},"content":{"rendered":"\n<ul class=\"wp-block-list\">\n<li>Time: every Tuesday 10:00-11:20am (KST)<\/li>\n\n\n\n<li>Where: B332<\/li>\n\n\n\n<li>Zoom: 984 6685 3918, PW: 202302<\/li>\n<\/ul>\n\n\n\n<h4 class=\"wp-block-heading\"><span style=\"color: #222222;background-color: #ff6900\" class=\"stk-highlight\">Announcement<\/span><\/h4>\n\n\n\n<ul class=\"wp-block-list\">\n<li><\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Date<\/td><td>Paper<\/td><td>Presenter<\/td><\/tr><tr><td>02\/14<\/td><td><strong>Antichain Codes<br><\/strong><a href=\"https:\/\/arxiv.org\/abs\/2212.08406\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2212.08406<\/a><\/td><td>Zixiang Xu<\/td><\/tr><tr><td>02\/21<\/td><td><strong>A new approach for the Brown-Erdos-Sos problem<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2301.07758\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2301.07758<\/a><\/td><td>Jun Gao<\/td><\/tr><tr><td>02\/28<\/td><td><strong>Rational Exponents Near Two<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2203.03375\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2203.03375<\/a><\/td><td>Nika Salia<\/td><\/tr><tr><td>03\/07<\/td><td><strong>Hasse diagrams with large chromatic number<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2001.09901\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2001.09901<\/a><\/td><td>Minho Cho<\/td><\/tr><tr><td>03\/14<\/td><td><strong>Better bounds for the union-closed sets conjecture using the entropy approach<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2212.12500\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2212.12500<\/a><\/td><td>Stijn Cambie<\/td><\/tr><tr><td>03\/21<\/td><td><strong>Clique covers of H-free graphs<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2211.12065\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2211.12065<\/a><\/td><td>Suyun Jiang<\/td><\/tr><tr><td>03\/28<\/td><td><strong>Optimal thresholds for latin squares, steiner triple systems, and edge colorings<br><\/strong><a href=\"https:\/\/arxiv.org\/abs\/2212.06109\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2212.06109<\/a><\/td><td>Yuqi Zhao<\/td><\/tr><tr><td>04\/04<\/td><td><strong>An oriented discrepancy version of Dirac&#8217;s theorem<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2211.06950\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2211.06950<\/a><\/td><td>Bingyu Luan<\/td><\/tr><tr><td>04\/11<\/td><td><strong>A multidimensional Ramsey Theorem<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2210.09227\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2210.09227<\/a><\/td><td>Nannan Chen<\/td><\/tr><tr><td>04\/18<\/td><td><strong>A note on estimating global subgraph counts by sampling<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2210.11336\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2210.11336<\/a><\/td><td>Lidan Ping<\/td><\/tr><tr><td>04\/25<\/td><td><strong>Largest subgraph from a hereditary property in a random graph<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2210.12754\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2210.12754<\/a><\/td><td>Xia Wang<\/td><\/tr><tr><td>05\/02<\/td><td><strong>The maximum number of triangles in a graph of given maximum degree<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/1912.01600\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/1912.01600<\/a><\/td><td>Lan Wei<\/td><\/tr><tr><td>05\/09<\/td><td><strong>Planar Turan numbers of cubic graphs and disjoint union of cycles<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2202.09216\">https:\/\/arxiv.org\/abs\/2202.09216<\/a><\/td><td>Fan Yang<\/td><\/tr><tr><td>05\/16<\/td><td><strong>Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2206.09334\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2206.09334<\/a><\/td><td>Lin Sun<\/td><\/tr><tr><td>05\/23<\/td><td><strong>Slicing all Edges of an n-cube Requires n^{2\/3} Hyperplanes<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2212.03328\">https:\/\/arxiv.org\/abs\/2212.03328<\/a><\/td><td>Haotian Yang<\/td><\/tr><tr><td>05\/30<\/td><td><strong>A lower bounding for set-coloring ramsey numbers<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2212.06802\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2212.06802<\/a><\/td><td>Xiaowei Yu<\/td><\/tr><tr><td>06\/06<\/td><td><strong>Sharper bounds on the Fourier concentration of DNFs<\/strong><br><a href=\"https:\/\/arxiv.org\/abs\/2109.04525\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/arxiv.org\/abs\/2109.04525<\/a><\/td><td>Fan Chang<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Announcement Date Paper Presenter 02\/14 Antichain Codeshttps:\/\/arxiv.org\/abs\/2212.08406 Zixiang Xu 02\/21 A new approach for the Brown-Erdos-Sos problemhttps:\/\/arxiv.org\/abs\/2301.07758 Jun Gao 02\/28 Rational Exponents Near Twohttps:\/\/arxiv.org\/abs\/2203.03375 Nika Salia 03\/07 Hasse diagrams with &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Reading Spring 2023&#8221;<\/span><\/a><\/p>\n","protected":false},"author":5,"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-3736","page","type-page","status-publish","hentry"],"featured_image_src":null,"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.5 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Reading Spring 2023 - 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\/reading-spring-2023\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Reading Spring 2023 - Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"og:description\" content=\"Announcement Date Paper Presenter 02\/14 Antichain Codeshttps:\/\/arxiv.org\/abs\/2212.08406 Zixiang Xu 02\/21 A new approach for the Brown-Erdos-Sos problemhttps:\/\/arxiv.org\/abs\/2301.07758 Jun Gao 02\/28 Rational Exponents Near Twohttps:\/\/arxiv.org\/abs\/2203.03375 Nika Salia 03\/07 Hasse diagrams with &hellip; Continue reading &quot;Reading Spring 2023&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/\" \/>\n<meta property=\"og:site_name\" content=\"Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"article:modified_time\" content=\"2023-03-07T00:55:43+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=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/reading-spring-2023\\\/\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/reading-spring-2023\\\/\",\"name\":\"Reading Spring 2023 - Extremal Combinatorics and Probability Group\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#website\"},\"datePublished\":\"2023-02-06T23:45:12+00:00\",\"dateModified\":\"2023-03-07T00:55:43+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/reading-spring-2023\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/reading-spring-2023\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/reading-spring-2023\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Reading Spring 2023\"}]},{\"@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":"Reading Spring 2023 - 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\/reading-spring-2023\/","og_locale":"en_US","og_type":"article","og_title":"Reading Spring 2023 - Extremal Combinatorics and Probability Group","og_description":"Announcement Date Paper Presenter 02\/14 Antichain Codeshttps:\/\/arxiv.org\/abs\/2212.08406 Zixiang Xu 02\/21 A new approach for the Brown-Erdos-Sos problemhttps:\/\/arxiv.org\/abs\/2301.07758 Jun Gao 02\/28 Rational Exponents Near Twohttps:\/\/arxiv.org\/abs\/2203.03375 Nika Salia 03\/07 Hasse diagrams with &hellip; Continue reading \"Reading Spring 2023\"","og_url":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/","og_site_name":"Extremal Combinatorics and Probability Group","article_modified_time":"2023-03-07T00:55:43+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/","url":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/","name":"Reading Spring 2023 - Extremal Combinatorics and Probability Group","isPartOf":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/#website"},"datePublished":"2023-02-06T23:45:12+00:00","dateModified":"2023-03-07T00:55:43+00:00","breadcrumb":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.ibs.re.kr\/ecopro\/reading-spring-2023\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.ibs.re.kr\/ecopro\/"},{"@type":"ListItem","position":2,"name":"Reading Spring 2023"}]},{"@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":"hongliu","author_link":"https:\/\/www.ibs.re.kr\/ecopro\/author\/hongliu\/"},"uagb_comment_info":0,"uagb_excerpt":"Announcement Date Paper Presenter 02\/14 Antichain Codeshttps:\/\/arxiv.org\/abs\/2212.08406 Zixiang Xu 02\/21 A new approach for the Brown-Erdos-Sos problemhttps:\/\/arxiv.org\/abs\/2301.07758 Jun Gao 02\/28 Rational Exponents Near Twohttps:\/\/arxiv.org\/abs\/2203.03375 Nika Salia 03\/07 Hasse diagrams with &hellip; Continue reading \"Reading Spring 2023\"","jetpack_sharing_enabled":true,"ticketed":false,"_links":{"self":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3736","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\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/comments?post=3736"}],"version-history":[{"count":5,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3736\/revisions"}],"predecessor-version":[{"id":3795,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/3736\/revisions\/3795"}],"wp:attachment":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/media?parent=3736"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}