Can you trace this tree? Part II

Can you trace (the black outline of) this Christmas tree without lifting your finger off the screen?
You should go over each line segment exactly once.
In the comments, share an image of a Christmas tree that you have designed to challenge others!


Want more #Christmas problems? Check out the link!

#Combinatorics #Christmas

Note by Calvin Lin
7 years, 5 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

We'll have to find if it is an Eulerian Graph

Agnishom Chattopadhyay - 7 years, 5 months ago

Log in to reply

Keep it simple, Agni. Sometimes our minds overthink or jump to conclusions. I'm sure it's not completely necessary to use the Eulerian graph method.

Gaurav Simha - 7 years, 5 months ago

I just know the very much basics of graph theory, so I did it with common sense. But it seems to be a trail of the graph.

Siddharth Kumar - 7 years, 5 months ago

Note that we must start on a vertex with an odd number degree, otherwise it cannot be done. Therefore, we start at the vertex on top of the brown base. After starting there, any path will eventually take you to a complete path, given that you don't get to the tip of the tree (because the tip also has odd degree) before going to all the other places.

Daniel Liu - 7 years, 5 months ago

Where's part 1?

A Former Brilliant Member - 7 years, 5 months ago
×

Problem Loading...

Note Loading...

Set Loading...