Talk:Happy ending problem

General position
Brendan: is it really necessary to say no two points coincident, in the general position footnote? I'd think that would be covered by calling them a set. —David Eppstein 16:21, 7 October 2006 (UTC)


 * It's not mathematically necessary, and in fact it is also covered by "no three points are collinear". So it can be removed.  On the other hand, this article is aimed at general readers, who might find some redundancy helpful.  I'm happy either way. McKay 04:41, 15 November 2006 (UTC)

Name
Why is it named the 'happy ending' problem? Thanks! - Fasrad 04:03, 15 November 2006 (UTC)
 * See the first sentence of the article. McKay 04:36, 15 November 2006 (UTC)
 * Thanks! I need to stop reading Wikipedia late at night. Fasrad 19:57, 19 January 2007 (UTC)
 * But how exactly did its solution lead to a marriage? --Gwern (contribs) 19:48 7 January 2011 (GMT)


 * My recollection is that the HEP is the general statement, that is, for every n there is an f(n) such that it is true that among f(n) points some n form a convex polygon (and not the special case f(4)=5 proved by Ms Klein). Kope 16:24, 16 June 2007 (UTC)

Another reference
In hopes of convincing that the importance is more than low, here's an application of closely related ideas to an important open problem in algorithms:. But I'm not going to do more than mention this here for fear of violating WP:OR. —David Eppstein 19:10, 4 January 2007 (UTC)
 * Updated citation: So no longer any danger of being original research, but I'll let someone else mention it in the article here or not as they see fit as I think adding it myself would be too much of a conflict of interest. I've added self-refs to other articles, but only when they're more central to the topic; this one isn't so much about the happy ending problem itself as an application of related ideas to a different problem. It does, though, include a more efficient new algorithm for finding empty pentagons when they exist. —David Eppstein 16:58, 16 June 2007 (UTC)

Erdős–Szekeres conjecture... theorem!
I have proven the Erdős–Szekeres conjecture. The solution to it can be found on my website... http://www.oddperfectnumbers.com. It maps distinctly to the coverings of the posts on a Towers of Hanoi. I'm not trying to break any guidelines, just trying to provide the only answer; (talk) 22:27, 20 October 2012 (UTC)
 * The next step is to get it reliably published. We can't really do anything here unless/until that happens. —David Eppstein (talk) 05:02, 21 October 2012 (UTC)

In m-dimension
If k points must in a form of n-point m-dimension convex polygon, then $$k = m^{n-m}+1$$ — Preceding unsigned comment added by 115.80.80.42 (talk) 13:57, 26 June 2014 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Happy ending problem. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20060925032614/http://planetmath.org/encyclopedia/HappyEndingProblem.html to http://planetmath.org/encyclopedia/HappyEndingProblem.html
 * Added archive https://web.archive.org/web/20060925032736/http://planetmath.org/encyclopedia/RamseyTheoreticProofOfTheErdHosSzekeresTheorem.html to http://planetmath.org/encyclopedia/RamseyTheoreticProofOfTheErdHosSzekeresTheorem.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 00:52, 30 October 2017 (UTC)