Acesso público

Lower bounds for multicolor Ramsey numbers

D Conlon, A Ferber

Advances in Mathematics 378, 107528, 2021

Autorizações: US National Science Foundation

On the counting problem in inverse Littlewood–Offord theory

A Ferber, V Jain, K Luh, W Samotij

Journal of the London Mathematical Society 103 (4), 1333-1362, 2021

Autorizações: US National Science Foundation, US Department of Defense

[PDF] oup.com

Supersaturated sparse graphs and hypergraphs

A Ferber, G McKinley, W Samotij

International Mathematics Research Notices 2020 (2), 378-402, 2020

Autorizações: US National Science Foundation

[PDF] cambridge.org

Singularity of random symmetric matrices—a combinatorial approach to improved bounds

A Ferber, V Jain

Forum of Mathematics, Sigma 7, e22, 2019

Autorizações: US National Science Foundation, US Department of Defense

Counting and packing Hamilton cycles in dense graphs and oriented graphs

A Ferber, M Krivelevich, B Sudakov

Journal of Combinatorial Theory, Series B 122, 196-220, 2017

Autorizações: US National Science Foundation, Swiss National Science Foundation

Biased games on random boards

A Ferber, R Glebov, M Krivelevich, A Naor

Random Structures & Algorithms 46 (4), 651-676, 2015

Autorizações: German Research Foundation

Fast strategies in Maker–Breaker games played on random boards

D Clemens, A Ferber, M Krivelevich, A Liebenau

Combinatorics, Probability and Computing 21 (6), 897-915, 2012

Autorizações: German Research Foundation

[PDF] cambridge.org

Almost all Steiner triple systems are almost resolvable

A Ferber, M Kwan

Forum of Mathematics, Sigma 8, e39, 2020

Autorizações: US National Science Foundation, Swiss National Science Foundation

Optimal threshold for a random graph to be 2-universal

A Ferber, G Kronenberg, K Luh

Transactions of the American mathematical Society 372 (6), 4239-4262, 2019

Autorizações: US National Science Foundation

Packing spanning graphs from separable families

A Ferber, C Lee, F Mousset

Israel Journal of Mathematics 219, 959-982, 2017

Autorizações: US National Science Foundation, Luxembourg National Research Fund

Packing trees of unbounded degrees in random graphs

A Ferber, W Samotij

Journal of the London Mathematical Society 99 (3), 653-677, 2019

Autorizações: US National Science Foundation

Towards the linear arboricity conjecture

A Ferber, J Fox, V Jain

Journal of Combinatorial Theory, Series B 142, 56-79, 2020

Autorizações: US National Science Foundation, US Department of Defense

Finding Hamilton cycles in random graphs with few queries

A Ferber, M Krivelevich, B Sudakov, P Vieira

Random Structures & Algorithms 49 (4), 635-668, 2016

Autorizações: US National Science Foundation, Swiss National Science Foundation

Dirac-type theorems in random hypergraphs

A Ferber, M Kwan

Journal of Combinatorial Theory, Series B 155, 318-357, 2022

Autorizações: US National Science Foundation, Swiss National Science Foundation

[PDF] ieee.org

List-decodability with large radius for Reed-Solomon codes

A Ferber, M Kwan, L Sauermann

IEEE Transactions on Information Theory 68 (6), 3823-3828, 2022

Autorizações: US National Science Foundation

Building spanning trees quickly in Maker-Breaker games

D Clemens, A Ferber, R Glebov, D Hefetz, A Liebenau

SIAM journal on discrete mathematics 29 (3), 1683-1705, 2015

Autorizações: German Research Foundation, UK Engineering and Physical Sciences Research …

Spanning universality in random graphs

A Ferber, R Nenadov

Random Structures & Algorithms 53 (4), 604-637, 2018

Autorizações: US National Science Foundation

Finding paths in sparse random graphs requires many queries

A Ferber, M Krivelevich, B Sudakov, P Vieira

Random Structures & Algorithms 50 (1), 71-85, 2017

Autorizações: US National Science Foundation, Swiss National Science Foundation

Friendly bisections of random graphs

A Ferber, M Kwan, B Narayanan, A Sah, M Sawhney

Communications of the American Mathematical Society 2 (10), 380-416, 2022

Autorizações: US National Science Foundation