maths.free › Combinatorics & Graph Theory › An Introduction to Combinatorics › Combinatorics and Graph Theory

Combinatorics and Graph Theory

A graph G consists of a vertex set V and a collection E of 2-element subsets of V. Elements of E are called edges.

Combinatorics and Graph Theory

A graph \(G\) consists of a vertex set \(V\) and a collection \(E\) of \(2\)-element subsets of \(V\). Elements of \(E\) are called edges. In our course, we will (almost always) use the convention that \(V=\{1,2,3,\dots,n\}\) for some positive integer \(n\). With this convention, graphs can be described precisely with a text file:

  1. The first line of the file contains a single integer \(n\), the number of vertices in the graph.

  2. Each of the remaining lines of the file contains a pair of distinct integers and specifies an edge of the graph.

We illustrate this convention in with a text file and the diagram for the graph\(G\) it defines.

Much of the notation and terminology for graphs is quite natural. See if you can make sense out of the following statements which apply to the graph \(G\) defined above:

  1. \(G\) has \(9\) vertices and \(10\) edges.

  2. \(\{2,6\}\) is an edge.

  3. Vertices \(5\) and \(9\) are adjacent.

  4. \(\{5,4\}\) is not an edge.

  5. Vertices \(3\) and \(7\) are not adjacent.

  6. \(P = (4, 3,1, 7,9,5)\) is a path of length\(5\) from vertex \(4\) to vertex\(5\).

  7. \(C=(5,9,7,1)\) is cycle of length\(4\).

  8. \(G\) is disconnected and has two components. One of the components has vertex set \(\{2,6,8\}\).

  9. \(\{1,5,7\}\) is a triangle.

  10. \(\{1,7,5,9\}\) is a clique of size\(4\).

  11. \(\{4,2,8,5\}\) is an independent set of size\(4\).

Equipped only with this little bit of background material, we are already able to pose a number of interesting and challenging problems.

Example

Consider the graph \(G\)

  1. What is the largest \(k\) for which \(G\) has a path of length\(k\)?

  2. What is the largest \(k\) for which \(G\) has a cycle of length\(k\)?

  3. What is the largest \(k\) for which \(G\) has a clique of size\(k\)?

  4. What is the largest \(k\) for which \(G\) has an independent set of size\(k\)?

  5. What is the shortest path from vertex\(7\) to vertex\(6\)?

Suppose we gave the class a text data file for a graph on \(1500\) vertices and asked whether the graph contains a cycle of length at least \(500\). Raoul says yes and Carla says no. How do we decide who is right?

Suppose instead we asked whether the graph has a clique of size\(500\). Helene says that she doesn't think so, but isn't certain. Is it reasonable that her classmates insist that she make up her mind, one way or the other? Is determining whether this graph has a clique of size\(500\) harder, easier or more or less the same as determining whether it has a cycle of size\(500\).

We will frequently study problems in which graphs arise in a very natural manner. Here's an example.

Condensed: the full section is in Keller & Trotter, Applied Combinatorics.

Tani ti. Asnjë kalkulator nuk e zgjidh këtë, por pjesët e saj janë të llogaritura. Provo një më poshtë, ose shkruaj tënde.

Mbaje punën tënde

Një llogari e lirë shtohet shënime në çdo mësim, një regjistrim të asaj që ju keni përfunduar, problemet tuaja të zgjidhura në një vend, dhe një mësues që ju mund të pyesni rreth kësaj faqeje. Matematika vetë është e hapur për të gjithë, të regjistruar apo jo.

Regjistrohu Hyr

Simbolet e përdorura këtu

Prek çdo simbol për përkufizimin e plotë, një fotografi dhe se çfarë do të thotë çdo shkronjë në të.

Pyetja që bëjnë njerëzit

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Pjesa e kësaj faqeje është adaptuar nga Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). E përmbledhur dhe ri-shkruar këtu; gabimet janë tona.

Më shumë në Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs