Skip to main content
RobPratt's user avatar
RobPratt's user avatar
RobPratt's user avatar
RobPratt
  • Member for 5 years, 1 month
  • Last seen this week
  • NC, USA
comment
Minimum number of edges to be removed from a square grid so that no rectangles remain.
Before proving anything, you should define what an edge is and what a rectangle is. In particular, I would expect that a $1 \times 1$ grid has one node, no edges, and no rectangles, but that is inconsistent with your claim.
revised
Loading…
revised
Loading…
Loading…
Loading…
revised
Loading…
revised
Loading…
Loading…
revised
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
revised
Loading…
answered
Loading…
Loading…
revised
Loading…
Loading…