_id,doi,title
11706,10.1002/rsa.21106,Asymmetric Ramsey properties of random graphs involving cliques and cycles
14319,10.37236/11714,Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
14344,10.1137/1.9781611977554.ch88,Fast algorithms for solving the Hamilton cycle problem with high probability
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"
14867,10.5817/cz.muni.eurocomb23-005,Constructing Hamilton cycles and perfect matchings efficiently
13042,10.37236/11471,A note on long cycles in sparse random graphs
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
11740,10.37236/10607,Phase transition in cohomology groups of non-uniform random simplicial complexes
12151,10.1007/s10474-022-01265-8,On a question of Vera T. Sós about size forcing of graphons
12286,10.37236/10794,Loose cores and cycles in random hypergraphs
12432,10.1109/FOCS54457.2022.00091,Solving the Hamilton cycle problem fast on average