Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Proof of the Seymour Conjecture for Large Graphs
Endre Szemer
Type:
Article
Publication Date:
1998-01-01
Citations:
4
Share
Similar Works
Action
Title
Year
Authors
+
PDF
Chat
Proof of the Seymour conjecture for large graphs
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
+
Powers of Hamilton cycles of high discrepancy are unavoidable
2021
Domagoj Bradač
+
PDF
Chat
Towards a Hypergraph version of the Pósa–Seymour Conjecture
2023
Matías Pavez‐Signé
Nicolás Sanhueza‐Matamala
Maya Stein
+
PDF
Chat
Powers of Hamilton Cycles of High Discrepancy Are Unavoidable
2021
Domagoj Bradač
+
PDF
Chat
Powers of Hamilton Cycles of High Discrepancy are Unavoidable
2022
Domagoj Bradač
+
A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree $k$
2017
Lisa Sauermann
+
PDF
Chat
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth
2020
Tony Huynh
Gwenaël Joret
Piotr Micek
David R. Wood
+
PDF
Chat
Powers of Hamilton cycles in oriented and directed graphs
2024
Louis DeBiasio
Jie Han
Allan Lo
Theodore Molla
Simón Piga
Andrew Treglown
+
Seymour's self-minor conjecture for infinite graphs /
1989
Bogdan Oporowski
+
A proof of a conjecture of Erd\H{o}s, Faudree, Rousseau and Schelp on subgraphs of minimum degree $k$
2017
Lisa Sauermann
+
A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k
2018
Lisa Sauermann
+
Cycles of many lengths in Hamiltonian graphs
2021
Matija Bucić
Lior Gishboliner
Benny Sudakov
+
PDF
Chat
Minimum Degrees for Powers of Paths and Cycles
2022
Eng Keat Hng
+
Hamiltonian cycles with all small even chords
2012
Guantao Chen
Katsuhiro Ota
Akira Saito
Yi Zhao
+
PDF
Chat
Cycles of Many Lengths in Hamiltonian Graphs
2021
Matija Bucić
Lior Gishboliner
Benny Sudakov
+
On the Erdös-Sós conjecture and graphs with large minimum degree
2010
Nancy Eaton
Gary Tiner
+
Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs
2019
Shuya Chiba
Tomoki Yamashita
+
2-factors with k cycles in Hamiltonian graphs
2019
Matija Bucić
Erik Jahn
Alexey Pokrovskiy
Benny Sudakov
+
Hadwiger’s conjecture for powers of cycles and their complements
2006
Deming Li
Mingju Liu
+
Proof of the Erd\H{o}s-Simonovits conjecture on walks
2020
Grigoriy Blekherman
Annie Raymond
Works That Cite This (4)
Action
Title
Year
Authors
+
PDF
Chat
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
2007
H. A. Kierstead
Alexandr Kostochka
+
A Short Proof of the Hajnal-Szemer´ edi Theorem on Equitable Colouring
2008
H. A. K Ierstead
A. V. K Ostochka
+
Spanning Trees in Dense Graphs
2001
J Anos K Oml
E Ndre S Zemer
+
Distributing pairs of vertices on Hamiltonian cycles
2017
Weihua He
Hao Li
Qiang Sun
Works Cited by This (7)
Action
Title
Year
Authors
+
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
+
An algorithmic version of the blow-up lemma
1998
János Komlós
Gábor N. Sárközy
Endre Szemerédi
+
Blow-up Lemma
1997
János Komlós
Gábor N. Sárközy
Endre Szemerédi
+
The Square of Paths and Cycles
1995
Genghua Fan
H. A. Kierstead
+
Hamiltonian Square-Paths
1996
Genghua Fan
H. A. Kierstead
+
REGULAR PARTITIONS OF GRAPHS
1975
Endre Szemerédi