Andrii Arman

Research interests

Combinatorics, extremal graph theory, random graphs, random algorithms, Ramsey theory, Euclidean Ramsey theory, convex and discrete geometry, complex and classical analysis.

Publications

Published

1. Upper bounds on chromatic number of E^n in low dimensions, to appear in Electron. J. Combin., 17 pages, (with A.Bondarenko, A.Prymak, and D. Radchenko).

2. Linear-time uniform generation of random sparse contingency tables with specified marginals, to appear in Ann. Appl. Probab., 27 pages, (with P. Gao and N. Wormald).

3. Colourful matchings, SIAM J. Discrete Math. 37 (2) (2023), 26 pages (with M. T. Sales and V. Rödl).

4. Every Steiner triple system contains almost spanning d-ary hypertree, Electron. J. Combin. 29 (2022), 16 pages (with M. T. Sales and V. Rödl).

5. Independent sets in subgraphs of a shift graph, Electron. J. Combin. 29 (2022), 10 pages (with M. T. Sales and V. Rödl).

6. Increasing paths in countable graphs,  J. Combin. Theory Ser. A 183 (2021), 18 pages (with B. Elliott and V. Rödl).

7. Fast uniform generation of random graphs with given degree sequences,  Random Structures and Algorithms 59 (2021), 24 pages (with P. Gao and N. Wormald).

8. The maximum number of cycles in a graph with a fixed number of edges, Electron. J. Combin 26 (2019), 16 pages (with S.Tsaturian).

9. A note on weak delta systems,  Discrete Mathematics 342 (11) (2019), 9 pages (with B. Kay and V. Rödl).

10. A result in asymmetric Euclidean Ramsey theory, Discrete Mathematics 341 (5) (2018), 7 pages (with S. Tsaturian).

11. Note on Ramsey theorem for posets with linear extensions, Electron. J. Combin 24 (2017), 6 pages (with V. Rödl).

12. An upper bound for the size of a k-uniform intersecting family with covering number k, J. Combin. Theory Ser. A 147 (2017), 9 pages (with T. Retter).

13. Triangle-free graphs with the maximum number of cycles, Discrete Mathematics 339 (2016), 13 pages (with D. Gunderson and S. Tsaturian).

Conference publications

1. Fast uniform generation of random graphs with given degree sequences, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (with P. Gao and N. Wormald).

Other publications

1. Mathematical Competition of Ukrainian Students 2006–2007 (in Ukrainian, with A. Anikushyn et al.), published by Litera, Kiev, Ukraine (2008) 224 pages.

Submitted

1. Convex bodies of constant width with exponential illumination number (with A.Bondarenko and A.Prymak).

PhD Thesis

• Maximum number of cycles in graphs and multigraphs (written under supervision of Dr. D. Gunderson).

MSc Thesis

• Generalization of Ahlofrs Lemma and boundary behavior of analytic functions (written under supervision of Dr. N. Zorboska).

Teaching

University of Manitoba

• Math 1240 Elementary Discrete mathematics

• Math 1700 Calculus 2

• Math 1710 Applied calculus 2

• Training University of Manitoba Mathletics teams 

Emory University

• Math 112 Calculus 2

• Math 221 Linear algebra

• Math  532 Graph theory II

Monash University

• Math 9004 Mathematical foundations for data science

International College of Manitoba

• Math 1210 Techniques of classical and linear algebra

• Math 1300 Vector geometry and linear algebra