This is the current revision of this page, as edited by Cewbot(talk | contribs) at 04:36, 11 February 2024(Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "B" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.Revision as of 04:36, 11 February 2024 by Cewbot(talk | contribs)(Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "B" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.)
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
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 (talk • contribs) 09:49, 13 April 2020 (UTC)[reply]
