Re: Please help Graph Theory




Robert Israel wrote:
> In article <1138570992.735299.319590@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
> <charleshowardmath@xxxxxxxxx> wrote:
> >Could someone help me understand why this is true:
> > Every graph with average degree d contains a bipartite subgraph of
> >average degree at least d/2.
> >
> >Thanks Charles
>
> Hint: suppose we randomly label the vertices "a" and "b". What is
> the expected number of edges whose vertices have different labels?
>
> Robert Israel israel@xxxxxxxxxxx
> Department of Mathematics http://www.math.ubc.ca/~israel
> University of British Columbia Vancouver, BC, Canada

Extracting a deterministic conclusion by a probabilistic argument.

Very nice!. One actually gets average degree > d/2, if "a" and "b"
subsets are chosen of nearly equal numbers in bipartite subgraph.

regards, chip

.



Relevant Pages

  • Re: Graph Theory question
    ... John Gabbriel wrote: ... >> Every graph with average degree d contains a bipartite subgraph of ... Prev by Date: ...
    (comp.theory)
  • Re: Graph Theory question
    ... > Every graph with average degree d contains a bipartite subgraph of ... >average degree at least d/2. ... Prev by Date: ...
    (comp.theory)
  • Re: Please help Graph Theory
    ... > Every graph with average degree d contains a bipartite subgraph of ... >average degree at least d/2. ... Prev by Date: ...
    (sci.math)
  • Re: Is this an ODE system, and, if so, how do you solve it?
    ... On Aug 16, 2:44 pm, Robert Israel ... graph it? ... defining system of non ODEs is easy. ... What would the simplest ODE system be, ...
    (sci.math)
  • Newtons method in C one more qustion
    ... thanks to Robert Israel for answering some of my other questions about Newton's method. ... Taking this pullbacks we obtain an infinite graph. ... is it possible to conclude that taking sufficiently many pullbacks we finally arrive at the situation, when this graph contans all the poles of N_p? ...
    (sci.math)