Given a directed graph $G$, how to find a subgraph $G'$, where every node in $G'$ is isolated and the size of $G'$ is largest possible ?
closed as off-topic by Max Alekseyev, user44191, Chris Godsil, Wolfgang, darij grinberg May 15 at 7:22
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "MathOverflow is for mathematicians to ask each other questions about their research. See Math.StackExchange to ask general questions in mathematics." – Max Alekseyev, user44191, Chris Godsil, Wolfgang, darij grinberg