• YOU can help the next generation of students in the community!
    Share your trial papers and notes on our Notes & Resources page

Search results

  1. kfnmpah

    graph theory help

    changed what i said and now it makes sense i think kept the proof for k(m,n) max when |m-n| = minimised "the maximum number of edges in a simple graph on 2n vertices can be found by splitting the vertices in to 2 independent sets, A and B where the number of nodes in A (a) = the number of...
  2. kfnmpah

    graph theory help

    yeah i just realised that- take a simple pentagon, label the vertices 1, 2, 1 ,2 ,1 1 and 1 must be joined but it will still give max edges with no *triangles* as 6, as would a K2,3 graph fak whatever i will just write that on my thing, i don't even need to prove anything i just had to draw...
  3. kfnmpah

    Vote Compass

    disgusting
  4. kfnmpah

    graph theory help

    but this graph must be bipartite, yes? so what i said was "to satisfy the original conditions, the graph on 6 vertices (or in any general case for the vertex set of some simple graph, G) must be bipartite i.e. n nodes must be split in to two independent sets, A and B, say, with a and b number...
  5. kfnmpah

    graph theory help

    ok so i was thinking, the graph under the original conditions (no cycles of 3) has to be bipartite, right? no matter how you arrange the nodes if it satisfies the original conditions it will be bipartite and you could arrange it as a K(1,5) K(2,4) K(3,3) but the maximum number of edges wiill be...
  6. kfnmpah

    What have you eaten today?

    god dammit ily krispy kreme yep i love mini freddo varieties dey are so delicious + mini protein bar and a bottle of diet coke
  7. kfnmpah

    What have you eaten today?

    don't be ashamed of eating cake for breakfast i would eat cake for every meal if i could b: 1/2 grapefruit at uni: 4 mini freddos, banana at work: 2 mini caramello koalas d: protein shake
  8. kfnmpah

    graph theory help

    yeah, i'm really liking both streams (logic/sets + graph theory) of discrete so far ~i wish it was in the nsw curriculum~
  9. kfnmpah

    What have you eaten today?

    yep. put a *little* bit of salt and sugar on it (until all that awful awful natural peanut butter is gone. then get sanitarium crunchy with no added preservatives etc. still has salt + sugar added but yeezus it is good)
  10. kfnmpah

    What have you eaten today?

    yesssss EmHow banana + peanut butter so good
  11. kfnmpah

    What are you currently Reading?

    will read during holidays
  12. kfnmpah

    What have you eaten today?

    + 2 dates + 2 vego sausages and 2 eggs with salad + 2 scoops ice cream (roasted almond and boysenberry)
  13. kfnmpah

    What have you eaten today?

    b: coffee, lite babybel mini cheese wheel thing l:2 banans s: mini freddos/caramellos (1 x mint, 1 x dream, 1 x normal, 1 x caramello koaka)
  14. kfnmpah

    graph theory help

    http://blog.onetravel.com/travel/how-to-say-e2809cthank-youe2809d-in-58-languages.aspx yep yep yep i will do the odd one myself, i need to practice induction i am terribad at it u da best!!!
  15. kfnmpah

    graph theory help

    it is also probably wrong halp
  16. kfnmpah

    graph theory help

    yeah so how do i prove this by induction with (n+2) i have no idea what to do sub in n = (n+2) in (x/2)^2 and then what no i have (n^2 + 4n + 4)/4 and idk what to do with it :cry:
  17. kfnmpah

    What are you currently Reading?

    it does if you write it down i guess there is definitely merit to not writing things down, in a Proustian way. events/experiences are always exaggerated (good and bad) in your memory and they usually surpass any and every possible reality. e.g. homemade food when you're a child. nothing else...
  18. kfnmpah

    What are you currently Reading?

    what if you forget what if you get old and forget or get alzheimers lost 4eva
  19. kfnmpah

    What are you currently Reading?

    anyway keeping a journal is great everyone should do it
Top