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

Combinatorics and Geometry

There are many problems in geometry that are innately combinatorial or for which combinatorial techniques shed light on the problem. ExampleIn , we show a family of 4 lines in the plane.

Combinatorics and Geometry

There are many problems in geometry that are innately combinatorial or for which combinatorial techniques shed light on the problem.

Example

In , we show a family of \(4\) lines in the plane. Each pair of lines intersects and no point in the plane belongs to more than two lines. These lines determine\(11\) regions.

Under these same restrictions, how many regions would a family of \(8947\) lines determine? Can different arrangements of lines determine different numbers of regions?

Example

Mandy says she has found a set of\(882\) points in the plane that determine exactly \(752\) lines. Tobias disputes her claim. Who is right?

Example

There are many different ways to draw a graph in the plane. Some drawings may have crossing edges while others don't. But sometimes, crossing edges must appear in any drawing. Consider the graph \(G\)

Can you redraw \(G\) without crossing edges?

Suppose Sam and Deborah were given a homework problem asking whether a particular graph on \(2843952\) vertices and \(9748032\) edges could be drawn without edge crossings. Deborah just looked at the number of vertices and the number of edges and said that the answer is no. Sam questions how she can be so certainwithout looking more closely at the structure of the graph. Is there a way for Deborah to justify her definitive response?

Nu är det din tur. Ingen miniräknare bestämmer detta, men bitarna i det är beräkningsbara. Prova en nedan, eller skriv din egen.

Fortsätt jobba.

Ett gratis konto lägger till anteckningar om varje lektion, en förteckning över vad du har avslutat, dina lösta problem på ett ställe, och en handledare du kan fråga om denna sida. Matematiken i sig är öppen för alla, inloggad eller inte.

Registrera dig Inloggning

Symboler som används här

Knacka på alla symboler för den fullständiga definitionen, en bild, och vad varje bokstav i den betyder.

Frågor folk frågar

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.

Delar av denna sida är anpassade från Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Kondenserad och återförklarad här; felen är våra.

Mer information 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