Can you draw a shape?
You must use every line once. You cannot lift your pen. Do not draw the same line twice. This is a fun puzzle. Can you do it?
Can you draw a shape without lifting your pen?
You must use every line once. You cannot go over a line twice. This is a special kind of path.
A man named Leonhard Euler studied this. He looked at bridges in a city. He found out how to solve these puzzles. A shape works if the corners have an even number of lines. This helps you start and end in the right place.
It is a fun way to use math.
Imagine trying to draw a shape without lifting your pen.
You must use every line exactly once. You cannot go over any line twice. This is called an Eulerian trail.
If you start and end at the same spot, it is an Eulerian circuit.
Leonhard Euler first studied this in 1736. He was looking at a puzzle about seven bridges. He used math to see if a path could cross every bridge once. Euler found a rule for these paths. He looked at the corners, which we call vertices. A vertex is a point where lines meet. For a circuit to work, every vertex must have an even degree. The degree is just the number of lines meeting at that point. If a vertex has an odd number of lines, you might get stuck.
To have a trail that does not end where it began, you can have exactly two odd vertices. One is your start, and one is your end. A man named Carl Hierholzer later proved more about these shapes in 1873. Today, scientists use these ideas to study DNA.
Have you ever tried to draw a shape without lifting your pen?
Imagine a puzzle where you must trace every single line exactly once. You cannot go over any line a second time. This special path is called an Eulerian trail. If you manage to start and end at the same spot, it is called an Eulerian circuit.
These ideas help us understand how to move through networks of points and lines. We use the word "graph" to describe these connections. In a graph, the points where lines meet are called vertices. The lines themselves are called edges.
To find these paths, we look at the degree of each vertex. The degree is simply the number of edges connected to that point.
For an Eulerian circuit to exist, every single vertex must have an even degree. This is because every time you enter a vertex, you need an unused edge to leave it. If a graph has an Eulerian trail that is not a circuit, it is called semi-Eulerian. For this to happen, exactly zero or two vertices must have an odd degree. If there are two odd vertices, you must start at one and you will end at the other.
This math began with a famous puzzle in 1736.
A man named Leonhard Euler studied the Seven Bridges of Königsberg. He wanted to know if someone could walk through the city crossing every bridge exactly once. Euler proved that a circuit needs all vertices to have an even degree. He also stated that connected graphs with even degrees have a circuit. A man named Carl Hierholzer published the first complete proof of this later in 1873. This helped turn Euler's ideas into a solid mathematical rule.
There are different ways to find these paths using math rules. One way is called Fleury's algorithm, which was created in 1883. It works by choosing edges carefully so you do not disconnect the graph too early. Another way is Hierholzer's algorithm, which is much faster. It works by finding small loops and joining them together into one big tour.
Scientists also use these ideas in many modern ways. For example, experts in bioinformatics use Eulerian trails to help reconstruct DNA sequences from tiny fragments. They can also use these paths to design computer circuits.
Even when graphs are infinite, these rules still matter. An infinite graph might have an "Eulerian line." This is a path that goes on forever in both directions and covers every edge.
For this to work, the graph must be connected and have no odd degrees. It also must follow specific rules about how it can be divided. Whether we are looking at a small drawing or a huge network, these patterns help us find the best way to travel. Math lets us see the hidden paths in the world around us.
In the field of graph theory, mathematicians study networks of points and lines. These networks are called graphs. The points where lines meet are called vertices, and the lines themselves are called edges. An Eulerian trail is a specific type of path through a graph. It is a sequence of edges that visits every single edge in the graph exactly once. While you can visit the same vertex multiple times, you can never reuse an edge.
There are different types of Eulerian paths depending on where they begin and end. If the trail starts and ends at the same vertex, it is called an Eulerian circuit or an Eulerian cycle. A graph that contains such a cycle is known as an Eulerian graph. If a graph has an Eulerian trail that is not a circuit, it is called semi-Eulerian. In this case, the path must start at one vertex and end at a different one.
To understand if these paths exist, we must look at the degree of each vertex. The degree is the number of edges connected to that specific vertex. For an undirected graph to have an Eulerian circuit, every vertex must have an even degree. This is because every time a path enters a vertex, it must also leave it using a different edge. For an Eulerian trail to exist, the graph must have either zero or exactly two vertices with an odd degree. If there are exactly two odd vertices, the trail must start at one and end at the other.
The history of this concept began in 1736 with Leonhard Euler. He was investigating the Seven Bridges of Königsberg problem. The puzzle asked if a person could walk through the city crossing each of its seven bridges exactly once. By modeling the city as a graph, Euler proved that such a walk was impossible because the vertices did not have even degrees. While Euler identified the necessary conditions for these paths, he did not provide a full proof for all cases. It was not until 1873 that Carl Hierholzer published the first complete proof regarding the sufficiency of these conditions.
Mathematicians use specific algorithms to find these paths. Fleury's algorithm, created in 1883, is one method. It involves choosing edges one by one, ensuring that the chosen edge does not disconnect the graph unless no other choice remains. However, Fleury's algorithm is considered inefficient. A much faster method is Hierholzer's algorithm. This method works by finding a small closed tour and then finding additional loops from vertices within that tour. These smaller loops are then joined together to form one large Eulerian circuit.
These mathematical concepts have important modern applications. In bioinformatics, scientists use Eulerian trails to reconstruct DNA sequences from many small fragments. In computer engineering, they help in CMOS circuit design to find the best ordering for logic gates. Even in very large systems, these rules apply. For example, in directed graphs, an Eulerian cycle exists if every vertex has an equal in-degree and out-degree. This means the number of edges entering a vertex must match the number of edges leaving it.
Even when graphs are infinite, the concept continues through the Eulerian line. An Eulerian line is a doubly-infinite trail that covers every edge in an infinite graph. For this to exist, the graph must be connected and have a countable number of vertices and edges. It also requires that all vertices have even degrees. An infinite graph can fail to have an Eulerian line even if all its vertices have an even degree, such as in the Cayley graph.
Understanding these paths allows us to solve complex problems in both tiny biological structures and massive mathematical networks.
Where will your curiosity go next?
🖼️ Images & Media (8)
More to explore
✨ What else?
Related topics you might enjoy
🔬 Go deeper
More advanced topics to explore
🪜 Step back
Simpler topics to build understanding
What is Nepedia?
A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.