{"id":1276,"date":"2023-11-15T07:10:49","date_gmt":"2023-11-14T21:10:49","guid":{"rendered":"https:\/\/blogs.monash.edu\/discretemaths\/?p=1276"},"modified":"2023-11-09T07:20:55","modified_gmt":"2023-11-08T21:20:55","slug":"recent-papers","status":"publish","type":"post","link":"https:\/\/blogs.monash.edu\/discretemaths\/2023\/11\/15\/recent-papers\/","title":{"rendered":"Recent papers"},"content":{"rendered":"<p>Some recent papers by group members:<\/p>\n<p>Anita Liebenau, Nick Wormald<br \/>\n<a href=\"https:\/\/doi.org\/10.4171\/jems\/1355\">Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph<\/a><br \/>\nJ. European Math. Society 2023<\/p>\n<p>Vida Dujmovi\u0107, Louis Esperet, Pat Morin, David R. Wood.<br \/>\n<a href=\"https:\/\/arxiv.org\/abs\/2306.06224\">Proof of the clustered Hadwiger conjecture<\/a><br \/>\nProc. 64th IEEE Symposium on Foundations of Computer Science (FOCS \u201923)<\/p>\n<p>Aidan R. Gentle, Ian M. Wanless<br \/>\n<a href=\"https:\/\/doi.org\/10.1007\/s00026-022-00610-6\">On perfect sequence covering arrays<\/a><br \/>\nAnnals Comb. 2023<\/p>\n<p>Alexander Cant, Heiko Dietrich, Bettina Eick, and Tobias Moede.<br \/>\n<a href=\"https:\/\/doi.org\/10.1016\/j.jalgebra.2022.03.047\">Galois trees in the graph of p-groups of maximal class<\/a>.<br \/>\nJ. Algebra 2022.<\/p>\n<p>Anita Liebenau, Nick Wormald<br \/>\n<a href=\"https:\/\/doi.org\/10.1002\/rsa.21105\">Asymptotic enumeration of digraphs and bipartite graphs by degree sequence<\/a><br \/>\nRandom Structures Algorithms 2023<\/p>\n<p>Vida Dujmovi\u0107, Pat Morin, David R. Wood.<br \/>\n<a href=\"https:\/\/doi.org\/10.1016\/j.jctb.2023.03.004\">Graph product structure for non-minor-closed classes<\/a><br \/>\nJ. Combinatorial Theory Series B 2023<\/p>\n<p>Catherine Greenhill, Mikhail Isaev, Tam\u00e1s Makai, Brendan D. McKay<br \/>\n<a href=\"https:\/\/doi.org\/10.1017\/S0963548322000190\">Degree sequences of sufficiently dense random uniform hypergraphs<\/a><br \/>\nCombin. Probab. Comput. 2023<\/p>\n<p>David Eppstein, Robert Hickingbotham, Sergey Norin, Laura Merker, Michal T. Seweryn, David R. Wood.<br \/>\n<a href=\"https:\/\/doi.org\/10.1007\/s00454-022-00478-6\">Three-dimensional graph products with unbounded stack-number<\/a><br \/>\nDiscrete &amp; Computational Geometry 2023<\/p>\n<p>Ajani De Vas Gunasekara, Daniel Horsley<br \/>\n<a href=\"https:\/\/doi.org\/10.1137\/20M137321\">An Evans-style result for block designs<\/a><br \/>\nSIAM J. Discrete Math. 2022<\/p>\n<p>Timothy C. Burness, Melissa Lee<br \/>\n<a href=\"https:\/\/doi.org\/10.1007\/s11856-022-2416-1\">On the classification of extremely primitive affine groups<\/a><br \/>\nIsrael J. Math. 2023<\/p>\n<p>Antonio Gir\u00e3o, Freddie Illingworth, Alex Scott, David R. Wood.<br \/>\n<a href=\"https:\/\/doi.org\/10.1002\/rsa.21190\">Defective colouring of hypergraphs<\/a><br \/>\nRandom Structures Algorithms, 2023<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Some recent papers by group members: Anita Liebenau, Nick Wormald Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph J. European Math. Society 2023 Vida Dujmovi\u0107, Louis Esperet, Pat Morin, David R. Wood. Proof of the clustered Hadwiger conjecture Proc. 64th IEEE Symposium on Foundations of Computer Science (FOCS [&hellip;]<\/p>\n","protected":false},"author":992,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3330],"tags":[],"_links":{"self":[{"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/posts\/1276"}],"collection":[{"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/users\/992"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/comments?post=1276"}],"version-history":[{"count":8,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/posts\/1276\/revisions"}],"predecessor-version":[{"id":1284,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/posts\/1276\/revisions\/1284"}],"wp:attachment":[{"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/media?parent=1276"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/categories?post=1276"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.monash.edu\/discretemaths\/wp-json\/wp\/v2\/tags?post=1276"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}