Open Problem Garden
Help
About
Contact
login/create account
Home
»
Erdös-Szekeres conjecture
Now true for n = 6 as well
On April 14th, 2009 Anonymous says:
Now true for n = 6 as well by computer-aided solution of Szekeres and Peters (2006).
Reply
Are you a person?:
*
Subject:
Comment:
*
Comments are limited to a maximum of 1000 characters.
More information about formatting options
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more
login/create account
Drupal
CSI of Charles University
Now true for n = 6 as well
Now true for n = 6 as well by computer-aided solution of Szekeres and Peters (2006).