AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

Talk:Graph (graph theory)

From AoPSWiki

Things that need to be added to this article:

  • A proper definition of a graph. ("Formally, a graph G is a pair, G = (V, E), of a set V of vertices together with a subset E of pairs of members of V.") Done
  • Directed graphs, multigraphs, loopless graphs, simple graphs, and the distinctions between these.
  • "Path," "tree," "forest," "circuit" or "cycle," "Hamiltonian path" (and circuit and cycle), etc.
  • To distinguish between a formal graph (a pair of two sets) and a geometric realization of a graph.
  • Most of these words deserve their own page and so should be linked to.

I would have started doing this, but the first two points together are difficult to integrate into a single intro section. Help would be appreciated. --JBL 10:20, 4 January 2008 (EST)

The words that deserve their own page will be created eventually. For now, I'll just focus on integrating them into the article. I already defined path and cycle... I'll put a definition for tree in there, but I'm afraid that I don't know what some of the terms mean. Temperalxy 13:09, 4 January 2008 (EST)
Thanks. I'll continue to make some of the satellite pages and add to this one. --JBL 12:04, 11 January 2008 (EST)


AoPSWiki Words of the Week for January 3-9
Previous week
William Lowell Putnam Mathematical Competition
Diophantine equation
Current week
Graph (graph theory)
Carl Friedrich Gauss
Next week
Euclidean algorithm
Euclid
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us