{"id":4951,"date":"2024-11-04T21:25:06","date_gmt":"2024-11-04T12:25:06","guid":{"rendered":"https:\/\/www.ibs.re.kr\/ecopro\/?page_id=4951"},"modified":"2024-11-26T15:10:07","modified_gmt":"2024-11-26T06:10:07","slug":"development-in-combinatorics-4th-workshop-2024","status":"publish","type":"page","link":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/","title":{"rendered":"Development in Combinatorics 4th workshop 2024"},"content":{"rendered":"\n<p>The 4th online workshop <strong>Developments in Combinatorics<\/strong> will be held on November 27, 2024.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-luminous-vivid-orange-color\">Zoom: 917 5407 0896, password: 241127<\/mark><\/strong><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading has-text-align-center\">Invited Speakers<\/h2>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-9d6595d7 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Laihao-Ding-150x150.png\" alt=\"\" class=\"wp-image-4985\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Laihao-Ding-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Laihao-Ding-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Laihao Ding<\/strong><\/strong><br><em>Central China Normal University, China<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Barnabas-Janzer-150x150.png\" alt=\"\" class=\"wp-image-4983\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Barnabas-Janzer-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Barnabas-Janzer-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Barnabas Janzer<\/strong><\/strong><br><em>Oxford, UK<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Matthew-Kwan-150x150.png\" alt=\"\" class=\"wp-image-4994\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Matthew-Kwan-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Matthew-Kwan-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Matthew Kwan<\/strong><\/strong><br><em>Institute of Science and Technology Austria<\/em><br><\/p>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-9d6595d7 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Patrick-Morris-150x150.png\" alt=\"\" class=\"wp-image-4995\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Patrick-Morris-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Patrick-Morris-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Patrick Morris<\/strong><br><\/strong><em>Universitat Polit\u00e8cnica de Catalunya, Spain<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Victor-150x150.png\" alt=\"\" class=\"wp-image-4996\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Victor-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Victor-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Victor Falgas-Ravry<\/strong><\/strong><br><em>Umea University, Sweden<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Hladcky-150x150.png\" alt=\"\" class=\"wp-image-4984\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Hladcky-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Hladcky-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Jan Hladk\u00fd<\/strong><br><\/strong><em>Czech Academy of Sciences, Czechia<\/em><\/p>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-9d6595d7 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-150x150.png\" alt=\"\" class=\"wp-image-4987\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-300x300.png 300w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-768x765.png 768w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-402x400.png 402w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval-100x100.png 100w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Yuval.png 910w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Yuval Wigderson<\/strong><\/strong><br><em>ETH, Switzerland<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Marcelo-150x150.png\" alt=\"\" class=\"wp-image-4986\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Marcelo-150x150.png 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/Marcelo-100x100.png 100w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Marcelo Campos<\/strong><\/strong><br><em>Cambridge, UK<\/em><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\"><div class=\"wp-block-image is-style-rounded\">\n<figure class=\"aligncenter size-thumbnail\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-150x150.jpg\" alt=\"\" class=\"wp-image-4277\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-150x150.jpg 150w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-300x300.jpg 300w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-768x768.jpg 768w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-400x400.jpg 400w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2-100x100.jpg 100w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/01\/ander-2.jpg 1000w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/><\/figure>\n<\/div>\n\n\n<p class=\"has-text-align-center\"><strong><strong>Ander Lamaison<\/strong><br><\/strong><em>ECOPRO, IBS, Korea<\/em><\/p>\n<\/div>\n<\/div>\n\n\n\n<h2 class=\"wp-block-heading has-text-align-center\">Program<\/h2>\n\n\n\n<p>Korean time<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>15:30-16:00 <\/td><td>Laihao Ding<\/td><td>18:20-18:50<\/td><td>Jan Hladk\u00fd<\/td><\/tr><tr><td>16:00-16:30 <\/td><td>Barnabas Janzer<\/td><td>18:55-19:25<\/td><td>Yuval Wigderson<\/td><\/tr><tr><td>16:35-17:05<\/td><td>Matthew Kwan<\/td><td>19:30-20:00<\/td><td>Marcelo Campos<\/td><\/tr><tr><td>17:10-17:40<\/td><td>Patrick Morris<\/td><td>20:05-20:35<\/td><td>Ander Lamaison<\/td><\/tr><tr><td>17:45-18:15<\/td><td>Victor Falgas-Ravry<\/td><td><\/td><td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading has-text-align-center\">Abstracts<\/h2>\n\n\n<div class=\"wp-block-ub-content-toggle wp-block-ub-content-toggle-block\" id=\"ub-content-toggle-block-ea74899f-df23-4773-8d29-65ba8beeb1bd\" data-mobilecollapse=\"false\" data-desktopcollapse=\"true\" data-preventcollapse=\"false\" data-showonlyone=\"false\">\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-0-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Laihao Ding, <em>On 3-graphs with vanishing codegree Tur\u00e1n density<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-0-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>For a $k$-uniform hypergraph (or simply $k$-graph) $F$, the codegree Tur\u00e1n density $\\pi_{\\mathrm{co}} (F)$ is the supremum over all $\\alpha$ such that there exist arbitrarily large $n$-vertex $F$-free $k$-graphs $H$ in which every $(k-1)$-subset of $V(H)$ is contained in at least $\\alpha n$ edges. In this talk, I will introduce our recent progress on the problem of what $3$-graphs $F$ satisfy $\\pi_{\\mathrm{co}} (F)=0$.<\/p>\n\n\n\n<p>Our proof relies on a random geometric construction, graph distributions, Ramsey&#8217;s theorem and a new formulation of the characterization of $3$-graphs with vanishing uniform Tur\u00e1n density due to Reiher, R\u00f6dl and Schacht. Joint work with Ander Lamaison, Hong Liu, Shuaichao Wang and Haotian Yang.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-1-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Barnabas Janzer, <em>Extremal numbers of 0-1 matrices<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-1-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>A zero-one matrix M is said to contain another zero-one matrix A if we can delete some rows and columns of M and replace some 1-entries with 0-entries such that the resulting matrix is A. The extremal number of A, denoted ex(n,A), is the maximum number of 1-entries that an n\u00d7n zero-one matrix can have without containing A. We will describe known results and motivations for studying this problem, and give the first asymptotically tight general bound, showing that if A has at most t one-entries in every row, then ex(n,A)\u2264n^{2\u22121\/t+o(1)}. This verifies a conjecture of Methuku and Tomon, and provides a generalisation to a celebrated result of F\u00fcredi and Alon\u2014Krivelevich\u2014Sudakov about the Tur\u00e1n numbers of bipartite graphs. Joint work with Oliver Janzer, Van Magnan and Abhishek Methuku.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-2-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Matthew Kwan, <em>Resolution\u00a0of the\u00a0Quadratic\u00a0Littlewood-Offord problemBA<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-2-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>Consider a\u00a0quadratic\u00a0polynomial $Q(\\xi_{1},\\dots,\\xi_{n})$ of a random binary sequence $\\xi_{1},\\dots,\\xi_{n}$. To what extent can $Q(\\xi_{1},\\dots,\\xi_{n})$ concentrate on a single value? This is a\u00a0quadratic\u00a0version of the classical\u00a0Littlewood-Offord problem; it was was popularised by Costello, Tao and Vu in their study of symmetric random matrices, and has since become a rich source of connections between combinatorics, probability and computer science. In this talk we will discuss a new essentially optimal bound for the\u00a0quadratic\u00a0Littlewood-Offord problem, as conjectured by Nguyen and Vu. Joint work with Lisa Sauermann.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-3-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Patrick Morris, <em>Rainbow loose Hamilton cycles in Dirac hypergraphs<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-3-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>A meta-conjecture of Coulson, Keevash, Perarnau and Yepremyan states that above the extremal threshold for a given spanning structure in a (hyper-)graph, one can find a rainbow version of that spanning structure in any suitably bounded colouring of the host (hyper-)graph. We solve one of the most pertinent outstanding cases of this conjecture, by showing that for any $1\\leq j\\leq k-1$, if $G$ is a $k$-graph above the $j$-degree threshold for a loose Hamilton cycle, then any globally bounded colouring of $G$ contains a rainbow loose Hamilton cycle. This represents joint work with Amarja Kathapurkar and Guillem Perarnau.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-4-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Victor Falgas-Ravry, <em>On the geometry of random right-angled Coxeter groups<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-4-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>The right-angled Coxeter group (or RACG)\u00a0W=W(\u0393)\u00a0with presentation graph \u0393 = (V,E) is the group with generators V\u00a0and relations aa=1 and ab=ba for all a \u2208 V\u00a0and ab \u2208 E. By taking \u0393 to be an instance of the Erd\u0151s\u2013R\u00e9nyi\u00a0random graph model on\u00a0n\u00a0vertices with edge probability\u00a0p\u00a0=\u00a0p(n), one can generate a model for random RACG.\u00a0In recent years, geometric group theorists have investigated this model with a particular emphasis on the typical geometric properties of the random RACG. In this talk I will explain how one can obtain a rough threshold for relative hyperbolicity in this model and discuss the related problem of square percolation in random graphs.\u00a0Joint work with R. Altar\u00a0\u00c7i\u00e7eksiz\u00a0and Jason Berhstock.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-5-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Jan Hladk\u00fd, <em>Two results about dense inhomogeneous random graphs<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-5-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>A new model of random graphs emerged with the theory of dense graph limits. This model is parametrized by a graphon W, and generalizes Erd\u0151s-Renyi random graphs G(n,p) for p constant. While the inhomogeneous random graph G(n,W) is &#8220;dense&#8221;, on two classical problems from the theory of random graphs (the maximum clique problem and the connectivity problem) I will show that in a sense it can encompass also sparse random graphs. Based on [Dolezal, H., Mathe: Cliques in dense inhomogeneous random graphs] and [H., Viswanathan: Connectivity of inhomogeneous random graphs II].<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-6-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Yuval Wigderson, <em>Finding large blowups<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-6-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>A fundamental theorem of Nikiforov states that if a graph $G$ contains many copies of a fixed graph $H$, then it contains a large blowup of $H$. In this talk, I will discuss this theorem, some of its applications, as well as a recent result which determines the optimal quantitative dependencies in case $H$ is triangle-free. Joint work with Ant\u00f3nio Gir\u00e3o and Zach Hunter.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-7-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Marcelo Campos<\/strong><strong>, <em>Upper bounds for multicolour Ramsey numbers<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-7-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>The r-colour Ramsey number $R_r(k)$ is the minimum $n\\in \\mathbb{N}$ such that every r-colouring of the edges of the complete graph $K_n$ on n vertices contains a monochromatic copy of $K_k$. In this talk I will show that for each fixed $r\\geq 2$, that<\/p>\n\n\n\n<p>$$R_r(k)\\leq \\exp(-\\delta k)r^{rk}$$<\/p>\n\n\n\n<p>for some constant \u03b4=\u03b4(r)&gt;0 and all sufficiently large $k\\in \\mathbb{N}$. For each $r\\geq 3$, this is the first exponential improvement over the upper bound of Erd\u0151s and Szekeres from 1935. The proof uses a new geometric lemma and a new algorithm to find almost optimal monochromatic &#8216;books&#8217;.<\/p>\n\n\n\n<p>This is joint work with Paul Balister, B\u00e9la Bollob\u00e1s, Simon Griffiths, Eoin Hurley, Robert Morris, Julian Sahasrabudhe and Marius Tiba.<\/p>\n\n<\/div>\n\t\t<\/div>\n\n<div class=\"wp-block-ub-content-toggle-accordion\" style=\"border-color: #f1f1f1; \" id=\"ub-content-toggle-panel-block-\">\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-title-wrap\" style=\"background-color: #f1f1f1;\" aria-controls=\"ub-content-toggle-panel-8-ea74899f-df23-4773-8d29-65ba8beeb1bd\" tabindex=\"0\">\n\t\t\t<p class=\"wp-block-ub-content-toggle-accordion-title ub-content-toggle-title-ea74899f-df23-4773-8d29-65ba8beeb1bd\" style=\"color: #000000; \"><strong>Ander Lamaison, <em>Palettes determine uniform Tur\u00e1n density<\/em><\/strong><\/p>\n\t\t\t<div class=\"wp-block-ub-content-toggle-accordion-toggle-wrap left\" style=\"color: #000000;\"><span class=\"wp-block-ub-content-toggle-accordion-state-indicator wp-block-ub-chevron-down\"><\/span><\/div>\n\t\t<\/div>\n\t\t\t<div role=\"region\" aria-expanded=\"false\" class=\"wp-block-ub-content-toggle-accordion-content-wrap ub-hide\" id=\"ub-content-toggle-panel-8-ea74899f-df23-4773-8d29-65ba8beeb1bd\">\n\n<p>We study Tur\u00e1n problems for hypergraphs with an additional uniformity condition on the edge distribution. This kind of Tur\u00e1n problems was introduced by Erd\u0151s and S\u00f3s in the 1980s but it took more than 30 years until the first non-trivial exact results were obtained. Central to the study of the uniform Tur\u00e1n density of hypergraphs are palette constructions, which were implicitly introduced by R\u00f6dl in the 1980s. We prove that palette constructions always yield tight lower bounds, unconditionally confirming present empirical evidence. This results in new and simpler approaches to determining uniform Tur\u00e1n densities, which completely bypass the use of the hypergraph regularity method.<\/p>\n\n<\/div>\n\t\t<\/div>\n<\/div>\n\n\n<h2 class=\"wp-block-heading\">Organizers<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Hong Liu, IBS Extremal Combinatorics and Probability Group<\/li>\n\n\n\n<li>Guanghui Wang, Shandong University<\/li>\n\n\n\n<li>Guiying Yan, Chinese Academy of Sciences<\/li>\n\n\n\n<li>Fan Yang, Shandong University<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<div class=\"wp-block-stackable-image stk-block-image stk-block stk-7a5410d\" data-block-id=\"7a5410d\"><figure><span class=\"stk-img-wrapper stk-image--shape-stretch\"><img loading=\"lazy\" decoding=\"async\" class=\"stk-img wp-image-5020\" src=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg\" width=\"1810\" height=\"2560\" srcset=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg 1810w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-212x300.jpeg 212w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-724x1024.jpeg 724w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-768x1086.jpeg 768w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-1086x1536.jpeg 1086w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-1448x2048.jpeg 1448w, https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-283x400.jpeg 283w\" sizes=\"auto, (max-width: 767px) 89vw, (max-width: 1000px) 54vw, (max-width: 1071px) 543px, 580px\" \/><\/span><\/figure><\/div>\n","protected":false},"excerpt":{"rendered":"<p>The 4th online workshop Developments in Combinatorics will be held on November 27, 2024. Invited Speakers Laihao DingCentral China Normal University, China Barnabas JanzerOxford, UK Matthew KwanInstitute of Science and &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Development in Combinatorics 4th workshop 2024&#8221;<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":5020,"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-4951","page","type-page","status-publish","has-post-thumbnail","hentry"],"featured_image_src":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg","yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.6 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Development in Combinatorics 4th workshop 2024 - 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\/development-in-combinatorics-4th-workshop-2024\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Development in Combinatorics 4th workshop 2024 - Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"og:description\" content=\"The 4th online workshop Developments in Combinatorics will be held on November 27, 2024. Invited Speakers Laihao DingCentral China Normal University, China Barnabas JanzerOxford, UK Matthew KwanInstitute of Science and &hellip; Continue reading &quot;Development in Combinatorics 4th workshop 2024&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/\" \/>\n<meta property=\"og:site_name\" content=\"Extremal Combinatorics and Probability Group\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-26T06:10:07+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg\" \/>\n\t<meta property=\"og:image:width\" content=\"1810\" \/>\n\t<meta property=\"og:image:height\" content=\"2560\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\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=\"7 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\\\/development-in-combinatorics-4th-workshop-2024\\\/\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/\",\"name\":\"Development in Combinatorics 4th workshop 2024 - Extremal Combinatorics and Probability Group\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/wp-content\\\/uploads\\\/2024\\\/11\\\/DC-4-updated-scaled.jpeg\",\"datePublished\":\"2024-11-04T12:25:06+00:00\",\"dateModified\":\"2024-11-26T06:10:07+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/wp-content\\\/uploads\\\/2024\\\/11\\\/DC-4-updated-scaled.jpeg\",\"contentUrl\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/wp-content\\\/uploads\\\/2024\\\/11\\\/DC-4-updated-scaled.jpeg\",\"width\":1810,\"height\":2560},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/development-in-combinatorics-4th-workshop-2024\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.ibs.re.kr\\\/ecopro\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Development in Combinatorics 4th workshop 2024\"}]},{\"@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":"Development in Combinatorics 4th workshop 2024 - 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\/development-in-combinatorics-4th-workshop-2024\/","og_locale":"en_US","og_type":"article","og_title":"Development in Combinatorics 4th workshop 2024 - Extremal Combinatorics and Probability Group","og_description":"The 4th online workshop Developments in Combinatorics will be held on November 27, 2024. Invited Speakers Laihao DingCentral China Normal University, China Barnabas JanzerOxford, UK Matthew KwanInstitute of Science and &hellip; Continue reading \"Development in Combinatorics 4th workshop 2024\"","og_url":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/","og_site_name":"Extremal Combinatorics and Probability Group","article_modified_time":"2024-11-26T06:10:07+00:00","og_image":[{"width":1810,"height":2560,"url":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"7 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/","url":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/","name":"Development in Combinatorics 4th workshop 2024 - Extremal Combinatorics and Probability Group","isPartOf":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/#primaryimage"},"image":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/#primaryimage"},"thumbnailUrl":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg","datePublished":"2024-11-04T12:25:06+00:00","dateModified":"2024-11-26T06:10:07+00:00","breadcrumb":{"@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/#primaryimage","url":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg","contentUrl":"https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg","width":1810,"height":2560},{"@type":"BreadcrumbList","@id":"https:\/\/www.ibs.re.kr\/ecopro\/development-in-combinatorics-4th-workshop-2024\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.ibs.re.kr\/ecopro\/"},{"@type":"ListItem","position":2,"name":"Development in Combinatorics 4th workshop 2024"}]},{"@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":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-scaled.jpeg",1810,2560,false],"thumbnail":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-150x150.jpeg",150,150,true],"medium":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-212x300.jpeg",212,300,true],"medium_large":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-768x1086.jpeg",525,742,true],"large":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-724x1024.jpeg",525,743,true],"1536x1536":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-1086x1536.jpeg",1086,1536,true],"2048x2048":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-1448x2048.jpeg",1448,2048,true],"dimag-thumbnail":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-283x400.jpeg",283,400,true],"twentyseventeen-featured-image":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-2000x1200.jpeg",2000,1200,true],"twentyseventeen-thumbnail-avatar":["https:\/\/www.ibs.re.kr\/ecopro\/wp-content\/uploads\/2024\/11\/DC-4-updated-100x100.jpeg",100,100,true]},"uagb_author_info":{"display_name":"hongliu","author_link":"https:\/\/www.ibs.re.kr\/ecopro\/author\/hongliu\/"},"uagb_comment_info":0,"uagb_excerpt":"The 4th online workshop Developments in Combinatorics will be held on November 27, 2024. Invited Speakers Laihao DingCentral China Normal University, China Barnabas JanzerOxford, UK Matthew KwanInstitute of Science and &hellip; Continue reading \"Development in Combinatorics 4th workshop 2024\"","jetpack_sharing_enabled":true,"ticketed":false,"_links":{"self":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/4951","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=4951"}],"version-history":[{"count":11,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/4951\/revisions"}],"predecessor-version":[{"id":5306,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/pages\/4951\/revisions\/5306"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/media\/5020"}],"wp:attachment":[{"href":"https:\/\/www.ibs.re.kr\/ecopro\/wp-json\/wp\/v2\/media?parent=4951"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}