Word-Representable Graphs: Letter Copies Bound
Statement
Are there graphs on n vertices requiring more than floor(n/2) copies of each letter for word-representation?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.