This
level-5 vital article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
user:David Eppstein found this pointer to be of "marginal relevance" and deleted it. I restored it because I disagree strongly. The concepts are (at least very nearly) dual. Just as every simple undirected graph has an intersection representation that labels each vertex with the set of edges incident on it, so every poset has a containment representation that labels each element with the set of comparabilities of which it is the second element. And just as intersection is one of the fundamental operations on sets, so containment is one of the fundamental relations on sets. Seems pretty relevant to me! David, do you still disagree?— PaulTanenbaum 03:24, 10 September 2007 (UTC)
The article Intersection (Line) Graphs of hypergraphs has some valuable examples and results and should be merged into this article. Zaslav ( talk) 06:49, 3 April 2008 (UTC)
This artcle is confusing totally; It may be deleted or linked to somewhere. It lists various definitions - that's it without any meanings or understandings. I do not know why we have such articles on wikipedia.
-- Tangi-tamma ( talk) 10:53, 3 April 2008 (UTC)
Read my reply on your talk page. Thanks. Let us keep all dialogues on your talk page - you take the credit.
--- Tangi-tamma ( talk) 21:56, 3 April 2008 (UTC)
When someone sets flag, please donot delete without asking. This artilcle does not meet the requirements and technically incorrect. Also it is too difficult for a layman to understand. It needs additional work.
-- Tangi-tamma ( talk) 01:34, 4 April 2008 (UTC)
-- Tangi-tamma ( talk) 01:34, 4 April 2008 (UTC)
"However, intersection graphs of line segments may be nonplanar as well, and recognizing intersection graphs of line segments is complete for the existential theory of the reals (Schaefer 2010)." Maybe NP-complete? 46.5.2.53 ( talk) 09:23, 26 October 2018 (UTC)
This
level-5 vital article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
user:David Eppstein found this pointer to be of "marginal relevance" and deleted it. I restored it because I disagree strongly. The concepts are (at least very nearly) dual. Just as every simple undirected graph has an intersection representation that labels each vertex with the set of edges incident on it, so every poset has a containment representation that labels each element with the set of comparabilities of which it is the second element. And just as intersection is one of the fundamental operations on sets, so containment is one of the fundamental relations on sets. Seems pretty relevant to me! David, do you still disagree?— PaulTanenbaum 03:24, 10 September 2007 (UTC)
The article Intersection (Line) Graphs of hypergraphs has some valuable examples and results and should be merged into this article. Zaslav ( talk) 06:49, 3 April 2008 (UTC)
This artcle is confusing totally; It may be deleted or linked to somewhere. It lists various definitions - that's it without any meanings or understandings. I do not know why we have such articles on wikipedia.
-- Tangi-tamma ( talk) 10:53, 3 April 2008 (UTC)
Read my reply on your talk page. Thanks. Let us keep all dialogues on your talk page - you take the credit.
--- Tangi-tamma ( talk) 21:56, 3 April 2008 (UTC)
When someone sets flag, please donot delete without asking. This artilcle does not meet the requirements and technically incorrect. Also it is too difficult for a layman to understand. It needs additional work.
-- Tangi-tamma ( talk) 01:34, 4 April 2008 (UTC)
-- Tangi-tamma ( talk) 01:34, 4 April 2008 (UTC)
"However, intersection graphs of line segments may be nonplanar as well, and recognizing intersection graphs of line segments is complete for the existential theory of the reals (Schaefer 2010)." Maybe NP-complete? 46.5.2.53 ( talk) 09:23, 26 October 2018 (UTC)