Talk:Haven (graph theory)

This is the talk page for discussing improvements to the Haven (graph theory) article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

This article is rated B-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

??? This article has not yet received a rating on the project's importance scale.

This article has been automatically rated by a bot or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the |auto= parameter.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Daily pageviews of this article

A graph should have been displayed here but graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at pageviews.wmcloud.org

Untitled[edit]

What does "even more strongly" in the last section mean? 32.178.136.137 (talk) 13:39, 15 May 2012 (UTC) Collin237[reply]

Having havens of orders 1, 2, 3, 4, 5, 6, .. (as stated in the previous clause) is not the same thing as, and weaker than, having a haven of infinite order (in the "even more strongly" clause). —David Eppstein (talk) 15:32, 15 May 2012 (UTC)[reply]

is a way of describing a strategy[edit]

"is a way of describing a strategy" is so vague it is meaningless. I'm out of my depth on this topic, but the first sentence should at least be comprehensible to the average reader. Is a haven a type of strategy? Bhny (talk) 04:02, 2 January 2015 (UTC)[reply]

Not really. The actual mathematical definition is in (surprise) the definition section. The short version is that it's a function from sets of vertices in a graph to other sets of vertices, obeying certain properties. If you have such a function in hand, you can use it as a roadmap to play the pursuit-evasion game, consulting the function to choose where to go on each step. In that sense it *describes* a strategy, or to say it another way, every haven corresponds to the strategy that you get by consulting it, and that's what the lead sentence is intended to mean, but that's different from saying that it *is* a strategy. If you wanted to define a strategy formally as a mathematical object, it would be a function of a different type, from game positions to the move that you would play in that position. —David Eppstein (talk) 05:56, 2 January 2015 (UTC)[reply]

Can you put your explanation in the lead? Bhny (talk) 13:48, 2 January 2015 (UTC)[reply]

Better now? —David Eppstein (talk) 23:28, 2 January 2015 (UTC)[reply]

Yes that's a little better, but why not include your full explanation. Bhny (talk) 02:35, 3 January 2015 (UTC)[reply]

Because it's the lead of an article on a highly WP:TECHNICAL subject and we want to start as accessible as we can. The full explanation is later in the article. —David Eppstein (talk) 03:03, 3 January 2015 (UTC)[reply]

But that's what I meant. Your explanation above is accessible and the current lead isn't. Bhny (talk) 03:54, 3 January 2015 (UTC)[reply]

Ok, I've made another attempt. I think your opinion on what is accessible for this subject is probably more accurate than mine, because this is too close to things I've worked on professionally for me to see it from a naive viewpoint. —David Eppstein (talk) 04:32, 3 January 2015 (UTC)[reply]