_id,doi,title
14444,10.1007/s11856-023-2513-9,Substructures in Latin squares
14499,10.1017/fmp.2023.17,"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture"
10775,10.1109/TIT.2022.3148779,List-decodability with large radius for Reed-Solomon codes
11145,10.1109/FOCS52979.2021.00075,List-decodability with large radius for Reed-Solomon codes
11186,10.1112/blms.12638,Large deviations in random latin squares
11443,10.1090/tran/8614,Extension complexity of low-dimensional polytopes
9572,10.1112/blms.12446,Acyclic subgraphs of tournaments with high chromatic number
9573,10.1112/blms.12345,Universality of random permutations
9576,10.1093/imrn/rnaa004,"Halfway to Rota’s basis conjecture"
9577,10.1093/imrn/rny064,Ramsey graphs induce subgraphs of quadratically many sizes
9578,10.1007/s11856-020-2035-7,Nearly-linear monotone paths in edge-ordered graphs
9581,10.1112/plms.12373,Almost all Steiner triple systems have perfect matchings
9582,10.1007/s00493-019-4086-0,Dense induced bipartite subgraphs in triangle-free graphs
9583,10.1017/fms.2020.29,Almost all Steiner triple systems are almost resolvable
9580,10.1007/s11856-019-1897-z,Hypergraph cuts above the average
9585,10.1090/tran/7729,Proof of a conjecture on induced subgraphs of Ramsey graphs
9586,10.1112/jlms.12192,Anticoncentration for subgraph statistics
9565,10.1002/rsa.20815,Counting Hamilton cycles in sparse random directed graphs
9567,10.1002/rsa.20814,"The random k‐matching‐free process"
9568,10.1002/rsa.20742,Intercalates and discrepancy in random Latin squares