How to avoid using the Regularity Lemma: Pósa’s conjecture revisited

Ian Levitt, Gábor N. Sárközy, Endre Szemerédi

Type: Article

Publication Date: 2009-06-14

Citations: 54

DOI: https://doi.org/10.1016/j.disc.2009.05.020

Similar Works

Action	Title	Year	Authors
+	A Note on the Kirwan’s Conjecture	2017	Y. J. Leung
+	A Note on Alperin′s Conjecture	1994	Geoffrey R. Robinson
+	A Note on a Brown's Conjecture	1984	Michiro Kondo
+	A proof of snevily’s conjecture	2011	Bodan Arsovski
+	Saari's conjecture revisited	1981	Julian Palmore
+	Beal's Conjecture: A Rigorous Proof	2024	J. N. Wilson
+	A Study of König's Lemma	2002	Kaj Börge Hansen
+	A Contribution to Guy’s Conjecture	2022	Yukio Matsumoto Yoshikazu Matsutani Ángel Montesinos-Amilibia Masami Oda Shuichi Ohki Tsuyoshi Sakai Tsukasa Shibuya
+	A Concise Proof of Beal’s Conjecture	2015	Jae Heon Yun
+	A Plain Proof of Beal’s Conjecture	2015	Jae Heon Yun
+	Notes on Foregger's conjecture	2012	Kateryna Melnykova
+	A note on Olech's Lemma	1991	Zvi Artstein Tadeusz Rzeżuchowski
+	An observation concerning Ryser's conjecture	1990	Ron Aharoni Ran Ziv
+	Rokhlin’s theorem, a problem and a conjecture	2021	Dennis Sullivan
+	A Contribution to Reich’s Conjecture	2019	D. Azé Jean-Noël Corvellec
+	Remarks on Harada’s conjecture	2018	Benjamin Sambale
+	Around Brody lemma	2017	Julien Duval
+	A quantitative analysis of Oka’s lemma	2006	Phillip S. Harrington
+	A Note on König's Lemma	1999	Kaj Börge Hansen
+	Consequences of the main conjecture	1987	Paul Vojta

Action	Title	Year	Authors
+	Spectral radius and the 2-power of Hamilton cycle	2022	Xinru Yan Xiaocong He Lihua Feng Weijun Liu
+ PDF Chat	A general approach to transversal versions of Dirac‐type theorems	2023	Pranshu Gupta Fabian Hamann Alp Müyesser Olaf Parczyk Amedeo Sgueglia
+ PDF Chat	Bounds for graph regularity and removal lemmas	2012	David Conlon Jacob Fox
+ PDF Chat	Ramsey Number of a Connected Triangle Matching	2015	András Gyárfás Gábor N. Sárközy
+	Spectral extremal problem on the square of ℓ-cycle	2024	Longfei Fang Yanhua Zhao
+	Compatible powers of Hamilton cycles in dense graphs	2024	Xiaohan Cheng Jie Hu Donglei Yang
+	Covering cycles in sparse graphs	2020	Frank Mousset Nemanja Škorić Miloš Trujić
+	Monochromatic cycle partitions of graphs with large minimum degree	2016	Louis DeBiasio Luke L. Nelsen
+ PDF Chat	Triangle resilience of the square of a Hamilton cycle in random graphs	2021	Manuela Fischer Nemanja Škorić Angelika Steger Miloš Trujić
+	Extremal Hypergraph Theory and Algorithmic Regularity Lemma for Sparse Graphs	2010	Rerum Naturalium Mathematisch-Naturwissenschaftlichen Fakultät

Action	Title	Year	Authors
+	On the Pósa-Seymour conjecture	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Extremal Graph Theory	1978	Béla Bollobás
+	On the square of a Hamiltonian cycle in dense graphs	1996	J�nos Koml�s G�bor N. S�rk�zy Endre Szemer�di
+ PDF Chat	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Square Hamiltonian cycles in graphs with maximal 4-cliques	1998	H. A. Kierstead J.A. Quintana
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi
+	The Square of a Hamiltonian Cycle	1994	Genghua Fan Roland Häggkvist
+	On F-Hamiltonian graphs	1999	Zhenqi Yang
+	The Square of Paths and Cycles	1995	Genghua Fan H. A. Kierstead