771 | -- | 819 | Stefan Ehard, Felix Joos. A Short Proof of the Blow-Up Lemma for Approximate Decompositions |
821 | -- | 852 | Gábor Elek, Gábor Tardos. Convergence and Limits of Finite Trees |
853 | -- | 880 | Jeff Kahn 0001, Jinyoung Park. The Number of Maximal Independent Sets in the Hamming Cube |
881 | -- | 894 | Hadi Kharaghani, Thomas Pender, Sho Suda. A Family of Balanced Generalized Weighing Matrices |
895 | -- | 911 | Abhishek Methuku, István Tomon. Bipartite Turán Problems for Ordered Graphs |
913 | -- | 951 | Ron Aharoni, Eli Berger, Joseph Briggs, Erel Segal-haLevi, Shira Zerbib. Fractionally Balanced Hypergraphs and Rainbow KKM Theorems |
953 | -- | 969 | Daniele Bartoli, Nicola Durante. On the Classification of Low-Degree Ovoids of Q(4,q) |
971 | -- | 996 | Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang. Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II |
997 | -- | 1010 | Manuel Bodirsky, Florian Starke. Maximal Digraphs with Respect to Primitive Positive Constructability |
1011 | -- | 1026 | Swee Hong Chan, Igor Pak, Greta Panova. Log-Concavity in Planar Random Walks |
1027 | -- | 1048 | Gábor Damásdi, Dömötör Pálvölgyi. Realizing an m-Uniform Four-Chromatic Hypergraph with Disks |
1049 | -- | 1079 | James Davies. Vertex-Minor-Closed Classes are χ-Bounded |
1081 | -- | 1098 | Zdenek Dvorák, Luke Postle. On Decidability of Hyperbolicity |
1099 | -- | 1118 | Ronen Eldan. Second-Order Bounds on Correlations Between Increasing Families |
1119 | -- | 1143 | Nóra Frankl, Andrey Kupavskii. Almost Sharp Bounds on the Number of Discrete Chains in the Plane |
1145 | -- | 1187 | Lior Gishboliner, Raphael Steiner, Tibor Szabó. Oriented Cycles in Digraphs of Large Outdegree |
1189 | -- | 1229 | Rani Hod, Michael Krivelevich, Tobias Müller 0001, Alon Naor, Nicholas C. Wormald. Component Games on Random Graphs |