problem . . . . . . .
Statement
problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 Michael Krivelevich (joint with Sahar Diskin, Itay Markbreit, Maksim Zhukovskii) A large hole in pseudo-random graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 Matija Bucić (joint with K. Hendrey, B. Mohar, R. Steiner, and L. Yepremyan) Long cycles in vertex transitive digraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Matthew Kwan (joint with Zach Hunter, Lisa Sauermann) Exponential anticoncentration of the permanent . . . . . . . . . . . . . . . . . . . . . 20 Benny Sudakov (joint with Zach Hunter, Aleksa Milojević, István Tomon) C4 -free subgraphs of high degree with geometric applications . . . . . . . . . . . 23 Anubhab Ghosal (joint with Peter Keevash) On the largest k-product-free subsets of the Symmetric and Alternating Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 Noam Lifshitz (joint with Shai Evra and Guy Kindler) Polynomial Bogolyubov for Special Linear Groups via Tensor Rank . . . . 29 Peter Allen (joint with Julia Böttcher, Jozef Skokan, Benny Sudakov) A bipartite Bollobás-Eldridge-Catlin conjecture . . . . . . . . . . . . . . . . . . . . . . 31 Matthew Jenssen (joint with Marcelo Campos, Marcus Michelen, Florian Pfender and Julian Sahasrabudhe) A polynomial improvement for the odd cycle–complete Ramsey numbers 32 Oliver Janzer (joint with Maria Axenovich, Wouter Cames van Batenburg, Lukas Michel, Mathieu Rundström) An improved upper bound for the multicolour Ramsey number of odd cycles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 Jeff Kahn (joint with Max Aires) More on balancing extensions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 The report passage is retained verbatim as the relevant context for this extracted problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.