Allan Lo
Allan Lo
Подтвержден адрес электронной почты в домене bham.ac.uk - Главная страница
Название
Процитировано
Процитировано
Год
The existence of designs via iterative absorption: hypergraph -designs for arbitrary
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1611.06827, 2016
812016
Proof of the 1-factorization and Hamilton decomposition conjectures
B Csaba, D Kühn, A Lo, D Osthus, A Treglown
American Mathematical Society 244 (1154), 2016
74*2016
Proof of the 1-factorization and Hamilton decomposition conjectures
B Csaba, D Kühn, A Lo, D Osthus, A Treglown
American Mathematical Society 244 (1154), 2016
642016
Edge-decompositions of graphs with high minimum degree
B Barber, D Kühn, A Lo, D Osthus
Advances in Mathematics 288, 337-385, 2016
572016
$$$$-actors in Hypergraphs Via Absorption
A Lo, K Markström
Graphs and Combinatorics 31 (3), 679-712, 2015
542015
Hypergraph -designs for arbitrary
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1706.01800, 2017
332017
Clique decompositions of multipartite graphs and completion of Latin squares
B Barber, D Kühn, A Lo, D Osthus, A Taylor
Journal of Combinatorial Theory, Series A 151, 146-201, 2017
312017
Properly coloured Hamiltonian cycles in edge-coloured complete graphs
A Lo
Combinatorica 36 (4), 471-492, 2016
282016
Minimum codegree threshold for (K43− e)-factors
A Lo, K Markström
Journal of Combinatorial Theory, Series A 120 (3), 708-721, 2013
272013
Rainbow Matchings of size\delta (G) in Properly Edge-colored Graphs
J Diemunsch, M Ferrara, A Lo, C Moffatt, F Pfender, PS Wenger
The Electronic Journal of Combinatorics 19 (2), #P52, 2012
26*2012
On the decomposition threshold of a given graph
S Glock, D Kühn, A Lo, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 139, 47-127, 2019
252019
An edge-colored version of Dirac's theorem
A Lo
SIAM Journal on Discrete Mathematics 28 (1), 18-36, 2014
252014
Fractional clique decompositions of dense graphs and hypergraphs
B Barber, D Kühn, A Lo, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 127, 148-186, 2017
242017
A multipartite version of the Hajnal–Szemerédi theorem for graphs and hypergraphs
A Lo, K Markström
Combinatorics, Probability and Computing 22 (1), 97-111, 2013
222013
The robust component structure of dense regular graphs and applications
D Kühn, A Lo, D Osthus, K Staden
Proceedings of the London Mathematical Society 110 (1), 19-56, 2015
192015
A Dirac type condition for properly coloured paths and cycles
A Lo
Journal of Graph Theory 76 (1), 60-87, 2014
192014
Perfect matchings in 3-partite 3-uniform hypergraphs
A Lo, K Markström
Journal of Combinatorial Theory, Series A 127, 22-57, 2014
182014
On a conjecture of Erd\H {o} s on locally sparse Steiner triple systems
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1802.04227, 2018
172018
Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case
B Csaba, D Kühn, A Lo, D Osthus, A Treglown
arXiv preprint arXiv:1401.4164, 2014
162014
A note on large rainbow matchings in edge-coloured graphs
A Lo, TS Tan
Graphs and Combinatorics 30 (2), 389-393, 2014
152014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20