Y by
"What is the maximum value of n for which a graph of edge metric dimension at most k can contain the complete graph K_n as a subgraph?" So guys. i need help with the steps? Anyone have hints. I don't know how to approach this.
The time is now - Spring classes are filling up!
Something appears to not have loaded correctly.