Stefan Glock

From MaRDI portal
(Redirected from Person:256987)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Hamilton cycles in pseudorandom graphs
Advances in Mathematics
2024-11-18Paper
Resolution of the Oberwolfach problem
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
The largest hole in sparse random graphs2024-09-13Paper
The intersection spectrum of 3-chromatic intersecting hypergraphs2024-09-13Paper
On the \((6,4)\)-problem of Brown, Erdős, and Sós
Proceedings of the American Mathematical Society. Series B
2024-06-27Paper
Conflict-free hypergraph matchings2024-05-14Paper
Tight Hamilton cycles with high discrepancy2023-12-15Paper
The largest hole in sparse random graphs
Random Structures & Algorithms
2023-10-17Paper
The largest hole in sparse random graphs
Random Structures & Algorithms
2023-10-17Paper
Optimal Hamilton covers and linear arboricity for random graphs2023-10-17Paper
The intersection spectrum of 3‐chromatic intersecting hypergraphs
Proceedings of the London Mathematical Society
2023-09-20Paper
New results for MaxCut in H$H$‐free graphs
Journal of the London Mathematical Society
2023-08-23Paper
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Memoirs of the American Mathematical Society
2023-04-26Paper
Short proofs for long induced paths
Combinatorics, Probability and Computing
2023-03-31Paper
Counting Hamilton cycles in Dirac hypergraphs
Combinatorics, Probability and Computing
2023-03-30Paper
Hamilton cycles in pseudorandom graphs2023-03-09Paper
Extremal aspects of graph and hypergraph decomposition problems
(available as arXiv preprint)
2022-11-18Paper
Extremal aspects of graph and hypergraph decomposition problems2022-11-18Paper
On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os2022-09-28Paper
The \(n\)-queens completion problem
Research in the Mathematical Sciences
2022-07-22Paper
Conflict-free hypergraph matchings2022-05-11Paper
An average degree condition for independent transversals
Journal of Combinatorial Theory. Series B
2022-03-03Paper
Resolution of the Oberwolfach problem
Journal of the European Mathematical Society (JEMS)
2021-07-05Paper
Pseudorandom hypergraph matchings
Combinatorics, Probability and Computing
2021-06-15Paper
Euler tours in hypergraphs
Combinatorica
2021-03-20Paper
Note on induced paths in sparse random graphs2021-02-18Paper
Decompositions into isomorphic rainbow spanning trees
Journal of Combinatorial Theory. Series B
2021-02-03Paper
On a conjecture of Erdős on locally sparse Steiner triple systems
Combinatorica
2020-12-18Paper
On a conjecture of Erdős on locally sparse Steiner triple systems
Combinatorica
2020-12-18Paper
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma
2020-11-20Paper
A rainbow blow-up lemma
Random Structures & Algorithms
2020-10-26Paper
Minimalist designs
Random Structures & Algorithms
2020-09-16Paper
A note on dense bipartite induced subgraphs2020-06-09Paper
On the decomposition threshold of a given graph
Journal of Combinatorial Theory. Series B
2019-11-21Paper
Triple systems with no three triples spanning at most five points
Bulletin of the London Mathematical Society
2019-08-15Paper
Hypergraph $F$-designs for arbitrary $F$2017-06-06Paper
The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
(available as arXiv preprint)
2016-11-21Paper
Optimal path and cycle decompositions of dense quasirandom graphs
Electronic Notes in Discrete Mathematics
2016-10-14Paper
Optimal path and cycle decompositions of dense quasirandom graphs
Journal of Combinatorial Theory. Series B
2016-03-14Paper
On thef-matching polytope and the fractionalf-chromatic index
International Journal of Computer Mathematics
2015-04-27Paper
On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Stefan Glock