{"693804":{"#nid":"693804","#data":{"type":"news","title":"Atlanta Combinatorics Colloquium","body":[{"value":"\u003Carticle class=\u0022colloquium-announcement\u0022\u003E\r\n  \u003Cheader\u003E\r\n    \u003Ch1\u003EAtlanta Combinatorics Colloquium\u003C\/h1\u003E\r\n    \u003Cp class=\u0022hosts\u0022\u003E\u003Cstrong\u003EJointly hosted by:\u003C\/strong\u003E GT School of Mathematics, Georgia State University, and Emory University\u003C\/p\u003E\r\n  \u003C\/header\u003E\r\n\r\n  \u003Csection class=\u0022event-details\u0022\u003E\r\n    \u003Ch2\u003EEvent \u0026amp; Location\u003C\/h2\u003E\r\n    \u003Cp\u003E\r\n      \u003Ctime datetime=\u00222026-11-20T16:00\u0022\u003EFriday, Nov 20, 2026\u003C\/time\u003E\u003Cbr\u003E\r\n      \u003Cstrong\u003ETalk:\u003C\/strong\u003E 4:00 PM \u2013 5:00 PM @ Skiles 005\u003Cbr\u003E\r\n      \u003Cstrong\u003EReception:\u003C\/strong\u003E 3:30 PM\r\n    \u003C\/p\u003E\r\n  \u003C\/section\u003E\r\n\r\n  \u003Csection class=\u0022lecture-info\u0022\u003E\r\n    \u003Ch2\u003ETitle: Random Graph Processes\u003C\/h2\u003E\r\n    \r\n    \u003Ch3\u003ELecture Abstract\u003C\/h3\u003E\r\n    \u003Cp\u003E\r\n      Fix a graph or uniform hypergraph \u003Cem\u003EF\u003C\/em\u003E and consider the following simple process. Start with the complete (hyper)graph \u003Cem\u003EK\u003Csub\u003En\u003C\/sub\u003E\u003C\/em\u003E on \u003Cem\u003En\u003C\/em\u003E vertices and repeatedly remove the edge set of a copy of \u003Cem\u003EF\u003C\/em\u003E, chosen uniformly at random among all copies present at that time. Stop when no copy of \u003Cem\u003EF\u003C\/em\u003E is left. This is the \u003Cem\u003EF\u003C\/em\u003E-removal process, and the key question is when it ends, that is, how many edges are left at the end.\r\n    \u003C\/p\u003E\r\n    \u003Cp\u003E\r\n      This question has proven to be very hard. In 2015, Bohman, Frieze and Lubetzky famously proved that the triangle-removal process typically ends with \u003Cem\u003En^\u003C\/em\u003E\u003Csup\u003E(3\/2+o(1))\u003C\/sup\u003E edges. Until now, the answer was not known for any other \u003Cem\u003EF\u003C\/em\u003E.\r\n    \u003C\/p\u003E\r\n    \u003Cp\u003E\r\n      We determine when the \u003Cem\u003EF\u003C\/em\u003E-removal process ends for many choices of \u003Cem\u003EF\u003C\/em\u003E. This includes cliques, where it confirms a well-known conjecture of Bennett and Bohman on the final number of edges. This is joint work with K\u00fchn.\r\n    \u003C\/p\u003E\r\n  \u003C\/section\u003E\r\n\r\n  \u003Csection class=\u0022speaker-info\u0022\u003E\r\n    \u003Ch2\u003EAbout the Speaker\u003C\/h2\u003E\r\n    \u003Cp\u003E\r\n      \u003Cstrong\u003EFelix Joos\u003C\/strong\u003E has been a full professor for discrete mathematics and theoretical computer science at Heidelberg University, Germany since 2024. He received a PhD from the University of Ulm in 2015 and was a postdoc at the University of Birmingham, UK until 2019. He joined Heidelberg University as an assistant professor in 2020. He works in extremal and probabilistic combinatorics, especially on graph decompositions, hypergraph matchings, and random constructions. He is one of the recipients of the European Prize in Combinatorics 2023.\r\n    \u003C\/p\u003E\r\n  \u003C\/section\u003E\r\n\r\n  \u003Cfooter\u003E\r\n    \u003Csection class=\u0022about-colloquium\u0022\u003E\r\n      \u003Ch3\u003EAbout the Colloquium\u003C\/h3\u003E\r\n      \u003Cp\u003E\r\n        Founded in 2022, the Atlanta Combinatorics Colloquium is jointly hosted by Georgia Tech, Georgia State University, and Emory University, with talks rotating among the three campuses.\r\n      \u003C\/p\u003E\r\n      \u003Cp\u003E\r\n        \u003Cstrong\u003EOrganized by:\u003C\/strong\u003E Tom Kelly (Georgia Tech), Liana Yepremyan (Emory), and Yi Zhao (GSU)\r\n      \u003C\/p\u003E\r\n      \u003Cp\u003E\r\n        \u003Ca href=\u0022https:\/\/tomkelly.math.gatech.edu\/acc\/index.html\u0022 target=\u0022_blank\u0022 rel=\u0022noopener\u0022\u003EAtlanta Combinatorics Colloquium Website\u003C\/a\u003E\r\n      \u003C\/p\u003E\r\n    \u003C\/section\u003E\r\n  \u003C\/footer\u003E\r\n\u003C\/article\u003E","summary":"","format":"limited_html"}],"field_subtitle":[{"value":"Prof. Felix Joos will speak on Random Graph Processes"}],"field_summary":[{"value":"The Atlanta Combinatorics Colloquium presents Professor Felix Joos speaking on Random Graph Processes. Founded in 2022, the Atlanta Combinatorics Colloquium is jointly hosted by Georgia Tech, Georgia State University, and Emory University, with talks rota","format":"limited_html"}],"field_summary_sentence":[{"value":"The Atlanta Combinatorics Colloquium presents Professor Felix Joos speaking on Random Graph Processes"}],"uid":"34518","created_gmt":"2026-11-05 17:05:17","changed_gmt":"2026-11-05 18:15:03","author":"sbarone7","boilerplate_text":"","field_publication":"","field_article_url":"","location":"Atlanta, GA","dateline":{"date":"2026-11-05T00:00:00-05:00","iso_date":"2026-11-05T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"681671":{"id":"681671","type":"image","title":"headshot_joos.jpg","body":"Professor Felix Joos","created":"1793898340","gmt_created":"2026-11-05 17:05:40","changed":"1793898340","gmt_changed":"2026-11-05 17:05:40","alt":"headshot_joos.jpg","file":{"fid":"266108","name":"headshot_joos.jpg","image_path":"\/sites\/default\/files\/2026\/11\/05\/headshot_joos.jpg","image_full_path":"http:\/\/hg.gatech.edu\/\/sites\/default\/files\/2026\/11\/05\/headshot_joos.jpg","mime":"image\/jpeg","size":1098290,"path_740":"http:\/\/hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/2026\/11\/05\/headshot_joos.jpg?itok=RYLn9vKo"}},"681672":{"id":"681672","type":"image","title":"poster_joos.png","body":"The Atlanta Combinatorics Colloquium presents Prof. Felix Joos","created":"1793898383","gmt_created":"2026-11-05 17:06:23","changed":"1793898383","gmt_changed":"2026-11-05 17:06:23","alt":"poster_joos.png","file":{"fid":"266109","name":"poster_joos.png","image_path":"\/sites\/default\/files\/2026\/11\/05\/poster_joos.png","image_full_path":"http:\/\/hg.gatech.edu\/\/sites\/default\/files\/2026\/11\/05\/poster_joos.png","mime":"image\/png","size":341991,"path_740":"http:\/\/hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/2026\/11\/05\/poster_joos.png?itok=FTZx01lj"}}},"media_ids":["681671","681672"],"related_links":[{"url":"https:\/\/tomkelly.math.gatech.edu\/acc\/index.html","title":"Atlanta Combinatorics Colloquium Website"}],"groups":[{"id":"1279","name":"School of Mathematics"}],"categories":[],"keywords":[{"id":"173647","name":"_for_math_site_"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"Sal Barone","format":"limited_html"}],"email":["comm@math.gatech.edu"],"slides":[],"orientation":[],"userdata":""}}}