My Math Forum > Art drawing a closed figure
 User Name Remember Me? Password

 Art Art and Architecture Forum - Math in our world, culture, buildings, natural wonders, nature, movies, music

February 13th, 2013, 09:10 PM   #11
Math Team

Joined: Mar 2012
From: India, West Bengal

Posts: 3,871
Thanks: 86

Math Focus: Number Theory
Re: drawing a closed figure

Quote:
 Originally Posted by mathmaniac Then can you post it?
I thought I had one proof, but now I think it has some flaws in it. Although, I am not an expert in graph theory. But I can assure you that soroban's conditions are not true. There are graphs which are not Eulerian, not even Hamiltonian, even though it's traceable.

 February 14th, 2013, 06:03 PM #12 Senior Member   Joined: Dec 2012 Posts: 450 Thanks: 0 Re: drawing a closed figure Balarka,I see nothing wrong with soroban's conjecture.I draw a lot of figures and everything was fine.I am trying to work out a proof. Let us ask him how did he reach the conjecture.
February 14th, 2013, 06:45 PM   #13
Math Team

Joined: Mar 2012
From: India, West Bengal

Posts: 3,871
Thanks: 86

Math Focus: Number Theory
Re: drawing a closed figure

Quote:
 Originally Posted by mathmaniac I see nothing wrong with soroban's conjecture
GP(5, 2) is the first counterexample. This figure has ten odd nodes and no even nodes, even though it is traceable. soroban gave the properties of an Eulerian graph, but there are traceable ones which are not Hamiltonian. I doubt there is a general criteria for traceability.

 February 14th, 2013, 06:50 PM #14 Senior Member   Joined: Dec 2012 Posts: 450 Thanks: 0 Re: drawing a closed figure Can you post the pic?
 February 14th, 2013, 07:33 PM #15 Math Team     Joined: Mar 2012 From: India, West Bengal Posts: 3,871 Thanks: 86 Math Focus: Number Theory Re: drawing a closed figure Sure. Well, you can search it in the net--its the peterson graph :
May 13th, 2013, 07:36 PM   #16
Senior Member

Joined: Dec 2012

Posts: 450
Thanks: 0

Re: drawing a closed figure

Quote:
 Originally Posted by mathbalarka I thought I had one proof, but now I think it has some flaws in it.
For a graph that is traceable from all vertices other than the first and last goes two lines,one reaching it and one out of it.There could be no line reaching the 1st one if the first and last and are not the same and there could also be no line going out of the last one.That makes the maximum odd vertices 2.

Quote:
 the peterson graph
Can you show how to trace it in one go without repeating a path?

 May 6th, 2015, 10:30 PM #17 Newbie   Joined: May 2015 From: USA Posts: 1 Thanks: 0 Math Focus: dezzler It's interesting Post to question and answer

 Tags closed, drawing, figure

,

,

draw any closed figure

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post ohc4r3 Linear Algebra 1 March 17th, 2013 05:25 AM Vasily Real Analysis 3 February 4th, 2013 12:49 PM 03sqq Real Analysis 4 November 13th, 2012 03:40 AM butabi Advanced Statistics 1 November 27th, 2011 08:19 AM Al_Ch Elementary Math 2 May 21st, 2009 05:53 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top