Skip to main content
prohibited graph minor's user avatar
prohibited graph minor's user avatar
prohibited graph minor's user avatar
prohibited graph minor
  • Member for 4 years, 1 month
  • Last seen more than 3 years ago
awarded
awarded
accepted
answered
Loading…
comment
Two from cubic subgraph hardness
I guess we require the graph to be non empty or else the problem is trivial
comment
Two from cubic subgraph hardness
@QuanquanLiu, the subgraph does not need to be induced. There is also no lower bound on the size of the subgraph.
awarded
awarded
asked
Loading…