Talk:Word-representable graph

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 (talk • contribs) 09:49, 13 April 2020 (UTC)