Pham presented the proof of a related conjecture of Talagrand, which also follows from their method.
Statement
Pham presented the proof of a related conjecture of Talagrand, which also follows from their method. Patrick Morris presented his recent proof of a beautiful conjecture of Krivele- vich, Sudakov and Szabó, on the threshold for the existence of a triangle-factor in a sparse pseudorandom graph. He also obtained bounds for gen- eral clique-factors, but for larger cliques it is not known (and it is a major open problem to determine) whether or not matching constructions exist. To mention just a few: Vincent Tassion described a beautiful proof (found with Laurin Köhler-Schindler) of an extremely general Russo–Seymour–Welsh theorem, only using symmetry and positive association; Shoham Letzter presented an almost-sharp bound on the maximum possible number of edges in an r-uniform hypergraph on n vertices that contains no tight cycles; Matija Bucic presented a breakthrough (found with Richard Montgomery) on an old conjecture of Erdős and Gallai, showing that every graph with n vertices can be decomposed into Opn log‹ nq cycles and edges; Lisa Sauermann described a method (found with Asaf Ferber and Matthew Kwan) of showing that certain list-decodable Reed–Solomon codes exist; Anita Liebenau presented some of her recent results with Nina Kamčev and Natasha Morrison on “uncommon” systems of equations; Ashwin Sah and Mehtaab Sawhney each described different aspects of their recent work (joint with Matthew Kwan and 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.