Stefan Glock
Stefan Glock
Подтвержден адрес электронной почты в домене eth-its.ethz.ch - Главная страница
Название
Процитировано
Процитировано
Год
The existence of designs via iterative absorption
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1611.06827, 2016
812016
Hypergraph -designs for arbitrary
S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1706.01800, 2017
332017
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
Resolution of the Oberwolfach problem
S Glock, F Joos, J Kim, D Kühn, D Osthus
Journal of the European Mathematical Society, 2021
202021
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
172018
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
172016
Euler tours in hypergraphs
S Glock, F Joos, D Kühn, D Osthus
arXiv preprint arXiv:1808.07720, 2018
12*2018
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
112021
Pseudorandom hypergraph matchings
S Ehard, S Glock, F Joos
Combinatorics, Probability and Computing 29 (6), 868-885, 2020
112020
A rainbow blow‐up lemma
S Glock, F Joos
Random Structures & Algorithms 56 (4), 1031-1069, 2020
102020
A rainbow blow-up lemma for almost optimally bounded edge-colourings
S Ehard, S Glock, F Joos
Forum of Mathematics, Sigma 8, 2020
92020
Triple systems with no three triples spanning at most five points
S Glock
Bulletin of the London Mathematical Society 51 (2), 230-236, 2019
72019
Minimalist designs
B Barber, S Glock, D Kühn, A Lo, R Montgomery, D Osthus
Random Structures & Algorithms 57 (1), 47-63, 2020
62020
Extremal aspects of graph and hypergraph decomposition problems
S Glock, D Kühn, D Osthus
arXiv preprint arXiv:2008.00926, 2020
32020
An average degree condition for independent transversals
S Glock, B Sudakov
arXiv preprint arXiv:2003.01683, 2020
32020
Note on induced paths in sparse random graphs
S Glock
arXiv preprint arXiv:2102.09289, 2021
12021
Counting Hamilton cycles in Dirac hypergraphs
S Glock, S Gould, F Joos, D Kühn, D Osthus
arXiv preprint arXiv:1911.08887, 2019
12019
New results for MaxCut in -free graphs
S Glock, O Janzer, B Sudakov
arXiv preprint arXiv:2104.06971, 2021
2021
The intersection spectrum of 3-chromatic intersecting hypergraphs
M Bucić, S Glock, B Sudakov
arXiv preprint arXiv:2010.00495, 2020
2020
A note on dense bipartite induced subgraphs
S Glock
arXiv preprint arXiv:2006.05101, 2020
2020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20