MHB Proving Degrees of Vertices in Graph G

  • Thread starter Thread starter Amer
  • Start date Start date
  • Tags Tags
    Degrees Graph
AI Thread Summary
In a graph G of order \(2n+1 \geq 5\), the degree of each vertex is either \(n+1\) or \(n+2\). The discussion revolves around proving that G must contain at least \(n+1\) vertices of degree \(n+2\) or at least \(n+2\) vertices of degree \(n+1\). An argument by contradiction is suggested, where assuming fewer vertices of each degree leads to a contradiction when counting edges. The conclusion is that the initial conditions cannot hold true without satisfying the degree requirements. Thus, the proof demonstrates the necessity of the stated vertex degree distribution in graph G.
Amer
Messages
259
Reaction score
0
The degree of every vertex of a graph G of order \[2n+1 \geq 5\] is either n+1 or n+2. Prove that G contains at least n+1 vertices of degree n+2 or at least n+2 vertex
 
Last edited:
Mathematics news on Phys.org
Is this question complete? It seems truncated.
 
The degree of every vertex of a graph G of order \[2n+1 \geq 5\] is either n+1 or n+2. Prove that G contains at least n+1 vertices of degree n+2 or at least n+2 vertex of degree n+1
 
Amer said:
The degree of every vertex of a graph G of order \[2n+1 \geq 5\] is either n+1 or n+2. Prove that G contains at least n+1 vertices of degree n+2 or at least n+2 vertices of degree n+1
Try using an argument by contradiction. Suppose that there are $x$ vertices of degree $n+1$, and $y$ vertices of degree $n+2$, and suppose that the result is false. Then $x\leqslant n+1$ and $y\leqslant n$. But $x+y=2n+1$. It follows that we must have $x=n+1$ and $y=n.$ By counting the number of edges in the graph, show that this leads to a contradiction.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Back
Top