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
Loading…
Loading…
revised
Loading…
revised
Loading…
Loading…
revised
Loading…
Loading…
comment
Characterizing the Result of Lift and Project Method for Integer Programming
This is Theorem 3.12 in Optimization over Integers by Bertsimas and Weismantel.
Loading…
Loading…
revised
Loading…
revised
Loading…
revised
How to find principal value of the cubic root?
deleted 2 characters in body; edited title
Loading…
Loading…
Loading…
Loading…
revised
Loading…
Loading…
Loading…
comment
Minimum number of edges to be removed from a square grid so that no rectangles remain.
OK, in graph theory that would be a $2 \times 2$ grid graph. Now for your $n=2$, that would have $9$ nodes and $12$ edges, and you are claiming that removing $2^2-2+1=3$ edges can eliminate all rectangles. What is a rectangle, and which $3$ edges do you remove?