Re: graph theory proof hint needed please

On Sep 5, 3:08 pm, bill <b92...@xxxxxxxxx> wrote:
On Sep 5, 6:55 am, bsd_mike <bsddo...@xxxxxxxxx> wrote:

If you had to prove that for every graph with more than 2 nodes there
exists
2 nodes which have the same degree, how might you start?
Assume that you can only have one vertex between each node.

A hint on how one might start would be appreciated.

Thanks,
Mike

The maximum number of edges at any node is (n-1)!

Bill J

Now I am really confused.
I thought the number of edges at any node would be n-1.
The number of edges for the whole graph would be (n-1)!
Where am I confused?

Another hint would be great too!

-Mike



.

Relevant Pages

  • Re: graph theory proof hint needed please
    ... I thought the number of edges at any node would be n-1. ... The number of edges for the whole graph would be! ... Another hint would be great too! ... Bill J ...
    (sci.math)
  • Re: graph theory proof hint needed please
    ... I thought the number of edges at any node would be n-1. ... The number of edges for the whole graph would be! ... Another hint would be great too! ... Bill J ...
    (sci.math)
  • Re: graph theory proof hint needed please
    ... I thought the number of edges at any node would be n-1. ... --- Christopher Heckman ... A graph cannot have a vertex with degree and a vertex ... Bill J ...
    (sci.math)
  • Re: graph theory proof hint needed please
    ... I thought the number of edges at any node would be n-1. ... The number of edges for the whole graph would be! ... Another hint would be great too! ... --- Christopher Heckman ...
    (sci.math)
  • Re: The Far Left Hillary Clinton
    ... Hint: I think I can conceive of what he ... Seriously, Bob, I just cannot do it. ... She is not Bill. ... snarky observation. ...
    (rec.gambling.poker)