Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person

Type: Preprint

Publication Date: 2019-01-01

Citations: 3

DOI: https://doi.org/10.48550/arxiv.1902.06164

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Finding any given 2‐factor in sparse pseudorandom graphs efficiently	2020	Jie Han Yoshiharu Kohayakawa Patrick Morris Yury Person
+	Clique factors in pseudorandom graphs	2021	Patrick Morris
+ PDF Chat	A tight condition for triangle factors in pseudorandom graphs	2021	Patrick Morris
+	Powers of Hamilton cycles in pseudorandom graphs	2014	Peter Allen Julia Böttcher Hiệp Hàn Yury Person Yoshiharu Kohayakawa
+	Clique factors in pseudorandom graphs	2023	Patrick Morris
+	Powers of Hamilton cycles in pseudorandom graphs	2014	Peter J. Allen Julia Böttcher Hiệp Hàn Yury Person Yoshiharu Kohayakawa
+ PDF Chat	Powers of Hamilton Cycles in Pseudorandom Graphs	2014	Peter Allen Julia Böttcher Hiệp Hàn Yoshiharu Kohayakawa Yury Person
+	Blow-up lemma for cycles in sparse random graphs	2021	Miloš Trujić
+ PDF Chat	Blow-up lemma for cycles in sparse random graphs	2021	Miloš Trujić
+	Blow-up lemma for cycles in sparse random graphs	2021	Miloš Trujić
+	Clique-factors in sparse pseudorandom graphs	2018	Jie Han Yoshiharu Kohayakawa Patrick Morris Yury Person
+	Local resilience of an almost spanning $k$-cycle in random graphs	2017	Nemanja Škorić Angelika Steger Miloš Trujić
+	Triangle Factors In Sparse Pseudo-Random Graphs	2004	Michael Krivelevich Benni Sudakov† Tibor Szabó
+	The Bandwidth Theorem in Sparse Graphs	2016	Peter Allen Julia Böttcher Julia Ehrenmüller Anusch Taraz
+	The Bandwidth Theorem in Sparse Graphs	2016	Peter J. Allen Julia Böttcher Julia Ehrenmüller Anusch Taraz
+ PDF Chat	Hamiltonicity of Sparse Pseudorandom Graphs	2024	Asaf Ferber Jie Han Dingjia Mao Roman Vershynin
+	Local resilience of an almost spanning $k$-cycle in random graphs	2017	Nemanja Škorić Angelika Steger Miloš Trujić
+ PDF Chat	Near-perfect clique-factors in sparse pseudorandom graphs	2020	Jie Han Yoshiharu Kohayakawa Yury Person
+	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs	2020	Hiệp Hàn Jie Han Patrick Morris
+	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs	2020	Hiệp Hàn Jie Han Patrick Morris

Works That Cite This (3)

Action	Title	Year	Authors
+	Clique-factors in sparse pseudorandom graphs	2019	Jie Han Yoshiharu Kohayakawa Patrick Morris Yury Person
+	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs	2020	Hiệp Hàn Jie Han Patrick Morris
+	Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu	2019	Jie Han Patrick Morris Andrew Treglown

Works Cited by This (31)

Action	Title	Year	Authors
+ PDF Chat	None	1995	Noga Alon
+	Embedding bounded degree spanning trees in random graphs	2014	Richard Montgomery
+	Explicit Ramsey graphs and orthonormal labelings	1994	Noga Alon
+	Universality and tolerance	2002	Noga Alon Michael Capalbo Yoshiharu Kohayakawa V. Rödl Andrzej Ruciński Endre Szemerédi
+ PDF Chat	Almost‐spanning universality in random graphs	2016	David Conlon Asaf Ferber Rajko Nenadov Nemanja Škorić
+	Tough graphs and hamiltonian circuits	1973	Vašek Chvátal
+	Cycles of even length in graphs	1974	J. A. Bondy Miklós Simonovits
+ PDF Chat	Explicit construction of linear sized tolerant networks	1988	Noga Alon Fan Chung
+	Sparse pseudo-random graphs are Hamiltonian	2003	Michael Krivelevich Benny Sudakov
+ PDF Chat	Tight Hamilton cycles in random hypergraphs	2013	Peter Allen Julia Böttcher Yoshiharu Kohayakawa Yury Person