Jump to content

Talk:Word-representable graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 09:50, 13 April 2020 (Signing comment by Hzantema - "Keep: new section"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Unassessed Low‑priority
WikiProject iconThis 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.
???This article has not yet received a rating on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Keep

It is clear that Sergey Kitaev plays a central role in the research of word-representable graphs. But as a solid book has been published on this topic, and a great number of publications appeared in refereed journals with high standard, often with established co-authors, I think there is sufficient argument to have a wikipedia page on this, and I am happy that Kitaev took the effort to start up such a page. Many of the results are elegant and far from trivial. The original issue may look quite ad hoc and not of interest, as soon as results show up, given connections to other topics, the topic becomes more mature and more of interest, as is often the case in combinatorial mathematics. — Preceding unsigned comment added by Hzantema (talkcontribs) 09:49, 13 April 2020 (UTC)[reply]