Question

okay my screen froze, continue the conjecture question here please!

Answer 1

okay so after taking in the info u sent me this is what i got

Answer 2

okay so after taking in the info u sent me this is what i got

Answer 3

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 4

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 5

do u see this (did it go through)

Answer 6

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 7

op apperently

Answer 8

You will want to refer to the vertex degrees in your conjecture.

Answer 9

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 10

how? like how

Answer 11

If a graph is connected and every vertex has even degree, then it has AT LEAST ONE EULER CIRCUIT (usually more).

Source: http://www.ctl.ua.edu/math103/euler/howcanwe.htm

Answer 12

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 13

could u write the conjecture? im just not seeing it when u tell me over the internet...its kinda confusing...

Answer 14

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 15

could u write the conjecture? im just not seeing it when u tell me over the internet...its kinda confusing...

Answer 16

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 17

ok how bout this,
when a graph is connected at every vertecie and it doesnt break that it is an Euler circit..... how bout that?

Answer 18

You might find it helpful to think of an example. In a previous diagram, you found the degree for each vertex.
A had a degree of 2
B, 3
C, 3
D, 2
E, 2
and F, 2

If all the vertices had an even degree, the graph would have one or more Euler Circuits. Since your graph has two vertices with a degree of 3 (an odd number), it does NOT have a Euler Circuit.

Answer 19

In the end, someone could write the conjecture for you, but if you don't understand it, then what's the point. It would be better if you wrote it.

Answer 20

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 21

so is what i wrote correct for the answer?

Answer 22

Quote:

ok how bout this, when a graph is connected at every vertecie and it doesnt break that it is an Euler circit..... how bout that?

End Quote

This is probably a better start than the last one you wrote.

Answer 23

Now you need to get something in there about the vertex degrees.

Answer 24

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 25

wht? do i put in?

Answer 26

See my last suggestion (i.e. use your other starting point). Your last statement is explaining how to find the degree of one vertex, not whether a graph is a Euler circuit or not.

Answer 27

when u pick a vertecie and count the number of line segnments arround it, if the line segments all go arround it and it doesnt break then its a Euler circit......(is this right)

Answer 28

can u just write it?

Answer 29

If you want someone to write it for you, just use the one from the website:

If a graph is connected and every vertex has even degree, then it has AT LEAST ONE EULER CIRCUIT (usually more).

Source: http://www.ctl.ua.edu/math103/euler/howcanwe.htm