I did get the question https://math.stackexchange.com/questions/1139050/planner-graph-and-trilateral to review
the question as I did get it:
title : Planner Graph and Trilateral
Suppose G be a Planner Graph with 16 vertex in which that degree of each vertex is 4. when we place this graph on plane as a planner graph, each finite region be a Trilateral or Foursquare, and boundary of infinite region is made up 4 edges. how many Trilateral edge be in such graph?
How we can solve this problem? this is a question on Mid Exam.
tags: probability, discrete-mathematics, graph-theory, computer-science, combinations
There is so much wrong with this question I think:
The tags probability, discrete-mathematics, computer-science, and combinations seem irrelevant
It is an exam question.
The question is I think rewritable to a proper question, but I was wondering would that be the best response in this case?
At the end I just flagged the question for moderators to have a look at it
Did I do this all correct, or what could I have done better?
Ps I noticed this question already received two upvotes