Jakob Schnitzer

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	The anti-Ramsey threshold of complete graphs	2023	Yoshiharu Kohayakawa Guilherme Oliveira Mota Olaf Parczyk Jakob Schnitzer
+ PDF Chat	A spanning bandwidth theorem in random graphs	2021	Peter Allen Julia Böttcher Julia Ehrenmüller Jakob Schnitzer Anusch Taraz
+	A spanning bandwidth theorem in random graphs	2019	Peter Allen Julia Böttcher Julia Ehrenmüller Jakob Schnitzer Anusch Taraz
+	A spanning bandwidth theorem in random graphs	2019	Peter J. Allen Julia Böttcher Julia Ehrenmüller Jakob Schnitzer Anusch Taraz
+	The anti-Ramsey threshold of complete graphs	2019	Yoshiharu Kohayakawa Guilherme Oliveira Mota Olaf Parczyk Jakob Schnitzer
+ PDF Chat	Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version	2018	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version	2018	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Resilience and anti-Ramsey properties of sparse random graphs and dense hypergraphs	2018	Jakob Schnitzer
+ PDF Chat	Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+ PDF Chat	Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by ( k − 2)-degree – approximate version	2016	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg

Common Coauthors

Coauthor	Papers Together
Guilherme Oliveira Mota	8
Josefran de Oliveira Bastos	6
Mathias Schacht	6
Fabian Schulenburg	6
Julia Ehrenmüller	3
Julia Böttcher	3
Anusch Taraz	3
Peter Allen	2
Yoshiharu Kohayakawa	2
Olaf Parczyk	2
Peter J. Allen	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree	2006	Daniela Kühn Deryk Osthus	4
+	An approximate Dirac-type theorem for k-uniform hypergraphs	2008	Vojtěch Rödl Endre Szemerédi Andrzej Ruciński	4
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	4
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	4
+	Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs	2015	Jie Han Yi Zhao	4
+	Loose Hamilton cycles in hypergraphs	2011	Peter Keevash Daniela Kühn Richard Mycroft Deryk Osthus	4
+ PDF Chat	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs	2013	Enno Buß Hiệp Hàn Mathias Schacht	4
+	Hamilton ℓ-cycles in uniform hypergraphs	2010	Daniela Kühn Richard Mycroft Deryk Osthus	4
+	Dirac-type results for loose Hamilton cycles in uniform hypergraphs	2009	Hiệp Hàn Mathias Schacht	4
+ PDF Chat	Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg	3
+	Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)	2010	Vojtěch Rödl Andrzej Ruciński	3
+ PDF Chat	Recent advances on Dirac-type problems for hypergraphs	2016	Yi Zhao	3
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	3
+	Szemerédi’s Regularity Lemma for Sparse Graphs	1997	Yoshiharu Kohayakawa	2
+ PDF Chat	Embedding large subgraphs into dense graphs	2009	Daniela Kühn Deryk Osthus	2
+	Proof of the bandwidth conjecture of Bollobás and Komlós	2008	Julia Böttcher Mathias Schacht Anusch Taraz	2
+ PDF Chat	Small subsets inherit sparse ε-regularity	2006	Stefanie Gerke Yoshiharu Kohayakawa Vojtěch Rödl Angelika Steger	2
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	2
+ PDF Chat	Dirac's theorem for random graphs	2012	Choongbum Lee Benny Sudakov	2
+ PDF Chat	Szemerédi's Regularity Lemma for Matrices and Sparse Graphs	2011	Alex Scott	2
+ PDF Chat	Large-scale structures in random graphs	2017	Julia Böttcher	2
+ PDF Chat	The Bandwidth Theorem in sparse graphs	2020	Peter Allen Julia Böttcher Julia Ehrenmüller Anusch Taraz	2
+	Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs	2015	Jie Han Yi Zhao	2
+	Szemerédi’s Regularity Lemma and Quasi-randomness	2003	Yoshiharu Kohayakawa V. Rödl	2
+ PDF Chat	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	The Uniformity Lemma for hypergraphs	1992	Péter Frankl V. Rödl	1
+	Blow-up lemmas for sparse graphs	2016	Peter Allen Julia Böttcher Hiệp Hàn Yoshiharu Kohayakawa Yury Person	1
+ PDF Chat	Anti-Ramsey threshold of cycles	2021	Gabriel F. Barros Bruno Pasqualotto Cavalar Guilherme Oliveira Mota Olaf Parczyk	1
+ PDF Chat	Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg	1
+	On an anti‐Ramsey threshold for sparse graphs with one triangle	2017	Yoshiharu Kohayakawa Pavlos B. Konstadinidis Guilherme Oliveira Mota	1
+	Triangle resilience of the square of a Hamilton cycle in random graphs.	2018	Manuela Fischer Nemanja Škorić Angelika Steger Miloš Trujić	1
+	Threshold functions	1987	B. Bollobás Andrew Thomason	1
+	An algorithmic framework for obtaining lower bounds for random Ramsey problems	2017	Rajko Nenadov Yury Person Nemanja Škorić Angelika Steger	1
+	Anti-Ramsey Threshold of Cycles for Sparse Graphs	2019	Gabriel F. Barros Bruno Pasqualotto Cavalar Guilherme Oliveira Mota Olaf Parczyk	1
+	Advances in anti-Ramsey theory for random graphs	2017	Guilherme Oliveira Mota	1
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	1
+	Threshold functions for small subgraphs	1981	Béla Bollobás	1
+	On an anti-Ramsey threshold for random graphs	2014	Yoshiharu Kohayakawa Pavlos B. Konstadinidis Guilherme Oliveira Mota	1
+	Regularity lemmas for hypergraphs and quasi‐randomness	1991	Fan Chung	1
+	Forbidding just one intersection	1985	Péter Frankl Zoltán Füredi	1
+	Rainbow subgraphs in properly edge‐colored graphs	1992	Vojtěch Rödl Źsolt Tuza	1
+ PDF Chat	Threshold functions for Ramsey properties	1995	Vojtěch Rödl Andrzej Ruciński	1