Stefan Glock

Discrete Mathematics and Combinatorics · 2016

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 16 citations into it
• Computational Theory and Mathematics — 11 citations into it
• Electrical and Electronic Engineering — 10 citations into it
• Geometry and Topology — 10 citations into it

Whom Stefan Glock trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Peter Keevash
2. Vojtech Rödl
3. Jozsef Balogh
4. Andrzej Rucinski
5. Darryn E. Bryant
6. Endre Szemerédi
7. Robert Morris
8. Mathias Schacht
9. Matthew Kwan
10. Yi Zhao

Papers from Stefan Glock's perspective

Ordered by how strongly the researchers Stefan Glock trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
2. The existence of designs
3. Combinatorial theorems in sparse random sets
4. Independent sets in hypergraphs
5. Extremal results for random discrete structures
6. A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
7. Counting designs
8. The existence of designs II
9. Almost all Steiner triple systems have perfect matchings (Proceedings of the London Mathematical Society)
10. Hypergraph regularity and the multidimensional Szemerédi theorem

Their papers

• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (2016) — 91 citations
• The existence of designs via iterative absorption (2016) — 103 citations