A graph theoretical approach for combinatorial designs

Short title	A graph theoretical approach for combinatorial designs
Status	Finished
Effective start/end date	1/11/16 → 31/10/18

The Existence of Designs via Iterative Absorption: Hypergraph F-Designs for Arbitrary F
Glock, S., Kuhn, D., Lo, A. & Osthus, D., 21 Mar 2023, In: Memoirs of the American Mathematical Society. 284, 1406, p. 1-144 144 p.
Research output: Contribution to journal › Article › peer-review

Open Access
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
Day, N. & Lo, A., May 2023, In: European Journal of Combinatorics. 110, 8 p., 103625.
Research output: Contribution to journal › Article › peer-review

Open Access
File
84 Downloads (Pure)
Transitive tournament tilings in oriented graphs with large minimum total degree
DeBiasio, L., Lo, A., Molla, T. & Treglown, A., 22 Feb 2021, In: SIAM Journal on Discrete Mathematics. 35, 1, p. 250–266 17 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
355 Downloads (Pure)

Project Details