Подписаться
Stefan Glock
Stefan Glock
Universität Passau
Подтвержден адрес электронной почты в домене uni-passau.de - Главная страница
Название
Процитировано
Процитировано
Год
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
122*2016
Hypergraph -designs for arbitrary
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1706.01800, 2017
412017
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
342019
Resolution of the Oberwolfach problem
S Glock, F Joos, J Kim, D Kühn, D Osthus
Journal of the European Mathematical Society 23 (8), 2511-2547, 2021
302021
On a conjecture of Erdős on locally sparse Steiner triple systems
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1802.04227, 2018
272018
Optimal path and cycle decompositions of dense quasirandom graphs
S Glock, D Kühn, D Osthus
Journal of Combinatorial Theory, Series B 118, 88-108, 2016
252016
Decompositions into isomorphic rainbow spanning trees
S Glock, D Kühn, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 146, 439-484, 2021
222021
Pseudorandom hypergraph matchings
S Ehard, S Glock, F Joos
Combinatorics, Probability and Computing 29 (6), 868-885, 2020
202020
Minimalist designs
B Barber, S Glock, D Kühn, A Lo, R Montgomery, D Osthus
Random Structures & Algorithms 57 (1), 47-63, 2020
192020
Euler tours in hypergraphs
S Glock, F Joos, D Kühn, D Osthus
arXiv preprint arXiv:1808.07720, 2018
18*2018
A rainbow blow‐up lemma
S Glock, F Joos
Random Structures & Algorithms 56 (4), 1031-1069, 2020
162020
Extremal aspects of graph and hypergraph decomposition problems
S Glock, D Kühn, D Osthus
Surveys in Combinatorics, London Math. Soc. Lecture Note Ser 470, 235-265, 2020
152020
A rainbow blow-up lemma for almost optimally bounded edge-colourings
S Ehard, S Glock, F Joos
Forum of Mathematics, Sigma 8, e37, 2020
152020
Triple systems with no three triples spanning at most five points
S Glock
Bulletin of the London Mathematical Society 51 (2), 230-236, 2019
132019
An average degree condition for independent transversals
S Glock, B Sudakov
Journal of Combinatorial Theory, Series B 154, 370-391, 2022
102022
Conflict-free hypergraph matchings
S Glock, F Joos, J Kim, M Kühn, L Lichev
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
72023
New results for MaxCut in -free graphs
S Glock, O Janzer, B Sudakov
arXiv preprint arXiv:2104.06971, 2021
72021
Counting Hamilton cycles in Dirac hypergraphs
S Glock, S Gould, F Joos, D Kühn, D Osthus
Combinatorics, Probability and Computing 30 (4), 631-653, 2021
62021
On the (6, 4)-problem of Brown, Erdos and Sós
S Glock, F Joos, J Kim, M Kühn, L Lichev, O Pikhurko
arXiv preprint arXiv:2209.14177, 2022
52022
Hamilton cycles in pseudorandom graphs
S Glock, DM Correia, B Sudakov
arXiv preprint arXiv:2303.05356, 2023
32023
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20